./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/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-?-48c9605-m [2025-02-08 07:43:54,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:43:55,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:43:55,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:43:55,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:43:55,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:43:55,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:43:55,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:43:55,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:43:55,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:43:55,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:43:55,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:43:55,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:43:55,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:43:55,078 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:43:55,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:43:55,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:43:55,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:43:55,079 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:43:55,079 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:43:55,079 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:43:55,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:43:55,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:43:55,079 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:43:55,080 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:43:55,080 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:43:55,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:43:55,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:43:55,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:43:55,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:43:55,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:43:55,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:43:55,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:43:55,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:43:55,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:43:55,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:43:55,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:43:55,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:43:55,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:43:55,081 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-02-08 07:43:55,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:43:55,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:43:55,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:43:55,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:43:55,377 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:43:55,379 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-02-08 07:43:56,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52358633b/715e37afb307459cb9b1652fee769fa0/FLAG62da326a8 [2025-02-08 07:43:57,046 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:43:57,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sync-2.i [2025-02-08 07:43:57,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52358633b/715e37afb307459cb9b1652fee769fa0/FLAG62da326a8 [2025-02-08 07:43:57,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52358633b/715e37afb307459cb9b1652fee769fa0 [2025-02-08 07:43:57,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:43:57,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:43:57,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:43:57,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:43:57,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:43:57,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:43:57" (1/1) ... [2025-02-08 07:43:57,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc21d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:57, skipping insertion in model container [2025-02-08 07:43:57,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:43:57" (1/1) ... [2025-02-08 07:43:57,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:43:57,857 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,860 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,863 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,865 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,868 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,868 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,869 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,869 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,870 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,877 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,880 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,882 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,891 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,893 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,903 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,917 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:43:57,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:43:57,958 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:43:58,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:43:58,215 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 07:43:58,222 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:43:58,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58 WrapperNode [2025-02-08 07:43:58,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:43:58,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:43:58,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:43:58,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:43:58,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,306 INFO L138 Inliner]: procedures = 540, calls = 474, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 702 [2025-02-08 07:43:58,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:43:58,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:43:58,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:43:58,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:43:58,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,350 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 07:43:58,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:43:58,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:43:58,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:43:58,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:43:58,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (1/1) ... [2025-02-08 07:43:58,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:43:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:58,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:43:58,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:43:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 07:43:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:43:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:43:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:43:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 07:43:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 07:43:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 07:43:58,744 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:43:58,746 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:43:59,436 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: full_write_#t~ret98#1 := safe_write_#res#1;havoc safe_write_#t~ret99#1, safe_write_#t~mem100#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret98#1 && full_write_#t~ret98#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret98#1;havoc full_write_#t~ret98#1; [2025-02-08 07:43:59,436 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886: assume full_write_~cc~0#1 < 0; [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886: assume !(full_write_~cc~0#1 < 0);full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903: safe_write_#t~ret99#1 := write_#res#1;havoc write_#t~nondet133#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret99#1 && safe_write_#t~ret99#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret99#1;havoc safe_write_#t~ret99#1; [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904: assume safe_write_~n~0#1 < 0; [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905: safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem100#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-1: SUMMARY for call safe_write_#t~mem100#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 07:43:59,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861: bb_verror_msg_#t~ret90#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet97#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret90#1 && bb_verror_msg_#t~ret90#1 <= 2147483647;havoc bb_verror_msg_#t~ret90#1; [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: bb_verror_msg_#t~ret92#1 := full_write_#res#1;havoc full_write_#t~ret98#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret92#1 && bb_verror_msg_#t~ret92#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset;havoc bb_verror_msg_#t~ret92#1; [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-1: assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret98#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-2: SUMMARY for call bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1980: write_#res#1 := write_~ret~1#1; [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1980-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret99#1, safe_write_#t~mem100#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:43:59,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet133#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet133#1;assume -9223372036854775808 <= write_#t~nondet133#1 && write_#t~nondet133#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet133#1;havoc write_#t~nondet133#1; [2025-02-08 07:43:59,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901: assume !true; [2025-02-08 07:43:59,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 07:43:59,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 07:43:59,503 INFO L? ?]: Removed 284 outVars from TransFormulas that were not future-live. [2025-02-08 07:43:59,503 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:43:59,531 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:43:59,531 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:43:59,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:43:59 BoogieIcfgContainer [2025-02-08 07:43:59,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:43:59,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:43:59,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:43:59,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:43:59,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:43:57" (1/3) ... [2025-02-08 07:43:59,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f422133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:43:59, skipping insertion in model container [2025-02-08 07:43:59,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:43:58" (2/3) ... [2025-02-08 07:43:59,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f422133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:43:59, skipping insertion in model container [2025-02-08 07:43:59,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:43:59" (3/3) ... [2025-02-08 07:43:59,540 INFO L128 eAbstractionObserver]: Analyzing ICFG sync-2.i [2025-02-08 07:43:59,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:43:59,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sync-2.i that has 3 procedures, 239 locations, 1 initial locations, 11 loop locations, and 107 error locations. [2025-02-08 07:43:59,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:43:59,622 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;@6b7ed335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:43:59,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 107 error locations. [2025-02-08 07:43:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 126 states have (on average 2.007936507936508) internal successors, (253), 232 states have internal predecessors, (253), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:43:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:43:59,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:59,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:43:59,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:43:59,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 10623, now seen corresponding path program 1 times [2025-02-08 07:43:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:59,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151388331] [2025-02-08 07:43:59,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:59,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:43:59,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:43:59,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:59,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:00,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151388331] [2025-02-08 07:44:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151388331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:00,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:00,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:44:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453015698] [2025-02-08 07:44:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:44:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:00,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:44:00,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:00,300 INFO L87 Difference]: Start difference. First operand has 239 states, 126 states have (on average 2.007936507936508) internal successors, (253), 232 states have internal predecessors, (253), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:00,429 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2025-02-08 07:44:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:44:00,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:44:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:00,440 INFO L225 Difference]: With dead ends: 111 [2025-02-08 07:44:00,440 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 07:44:00,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:00,445 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:00,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 85 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 07:44:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2025-02-08 07:44:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 89 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2025-02-08 07:44:00,493 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 2 [2025-02-08 07:44:00,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:00,493 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2025-02-08 07:44:00,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2025-02-08 07:44:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:44:00,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:00,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:44:00,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:44:00,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:00,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash 10624, now seen corresponding path program 1 times [2025-02-08 07:44:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:00,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414870565] [2025-02-08 07:44:00,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:00,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:44:00,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:44:00,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:00,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:00,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:00,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414870565] [2025-02-08 07:44:00,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414870565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:00,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:00,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:44:00,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792915842] [2025-02-08 07:44:00,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:00,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:44:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:00,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:44:00,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:00,878 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:00,971 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-02-08 07:44:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:44:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:44:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:00,972 INFO L225 Difference]: With dead ends: 91 [2025-02-08 07:44:00,972 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 07:44:00,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:00,973 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:00,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 07:44:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 07:44:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 88 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2025-02-08 07:44:00,986 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 2 [2025-02-08 07:44:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:00,986 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2025-02-08 07:44:00,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2025-02-08 07:44:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:44:00,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:00,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:44:00,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:44:00,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:00,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash 316735722, now seen corresponding path program 1 times [2025-02-08 07:44:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104531666] [2025-02-08 07:44:00,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:00,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:01,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:44:01,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:44:01,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:01,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104531666] [2025-02-08 07:44:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104531666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:01,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:01,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:44:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91072636] [2025-02-08 07:44:01,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:01,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:44:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:01,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:44:01,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:01,211 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:01,255 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-02-08 07:44:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:44:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:44:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:01,257 INFO L225 Difference]: With dead ends: 94 [2025-02-08 07:44:01,258 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 07:44:01,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:01,259 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:01,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:44:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 07:44:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-02-08 07:44:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 89 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2025-02-08 07:44:01,265 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 5 [2025-02-08 07:44:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:01,268 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2025-02-08 07:44:01,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2025-02-08 07:44:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:44:01,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:01,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:44:01,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:44:01,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 316735883, now seen corresponding path program 1 times [2025-02-08 07:44:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930969489] [2025-02-08 07:44:01,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:01,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:44:01,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:44:01,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:01,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:01,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930969489] [2025-02-08 07:44:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930969489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:01,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:01,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:44:01,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137914490] [2025-02-08 07:44:01,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:01,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:44:01,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:01,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:44:01,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:01,644 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:01,754 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-02-08 07:44:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:44:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:44:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:01,755 INFO L225 Difference]: With dead ends: 94 [2025-02-08 07:44:01,755 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 07:44:01,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:01,756 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:01,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 07:44:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-02-08 07:44:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 90 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-02-08 07:44:01,768 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 5 [2025-02-08 07:44:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:01,768 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-02-08 07:44:01,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-02-08 07:44:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:44:01,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:01,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:01,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:44:01,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:01,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash -164227526, now seen corresponding path program 1 times [2025-02-08 07:44:01,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:01,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893708175] [2025-02-08 07:44:01,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:01,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:01,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:44:01,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:44:01,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:01,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:01,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893708175] [2025-02-08 07:44:01,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893708175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968913507] [2025-02-08 07:44:01,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:01,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:01,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:01,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:01,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:44:02,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:44:02,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:44:02,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:02,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:02,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:44:02,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:02,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:02,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968913507] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:02,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:02,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:44:02,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568609773] [2025-02-08 07:44:02,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:02,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:44:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:02,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:44:02,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:44:02,269 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:02,319 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2025-02-08 07:44:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:44:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:44:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:02,325 INFO L225 Difference]: With dead ends: 101 [2025-02-08 07:44:02,326 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 07:44:02,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:44:02,327 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 355 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-02-08 07:44:02,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:44:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 07:44:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 07:44:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 98 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-02-08 07:44:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2025-02-08 07:44:02,337 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 8 [2025-02-08 07:44:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2025-02-08 07:44:02,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2025-02-08 07:44:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:44:02,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:02,339 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:02,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 07:44:02,543 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-02-08 07:44:02,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -164227365, now seen corresponding path program 1 times [2025-02-08 07:44:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440899609] [2025-02-08 07:44:02,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:02,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:44:02,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:44:02,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:02,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:02,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:02,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440899609] [2025-02-08 07:44:02,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440899609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:02,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507487218] [2025-02-08 07:44:02,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:02,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:02,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:02,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:02,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:44:02,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:44:03,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:44:03,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:03,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:03,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:44:03,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:03,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:03,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:44:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:03,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507487218] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:03,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:03,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:44:03,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234414740] [2025-02-08 07:44:03,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:03,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:44:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:03,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:44:03,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:44:03,304 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:03,564 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2025-02-08 07:44:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:44:03,565 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:44:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:03,566 INFO L225 Difference]: With dead ends: 100 [2025-02-08 07:44:03,566 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 07:44:03,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:44:03,569 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 160 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:03,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 415 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:44:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 07:44:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-08 07:44:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 97 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2025-02-08 07:44:03,577 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 8 [2025-02-08 07:44:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:03,577 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2025-02-08 07:44:03,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2025-02-08 07:44:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:44:03,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:03,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:44:03,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:44:03,778 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-02-08 07:44:03,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:03,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:03,779 INFO L85 PathProgramCache]: Analyzing trace with hash 73071850, now seen corresponding path program 2 times [2025-02-08 07:44:03,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:03,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139653643] [2025-02-08 07:44:03,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:44:03,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:03,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 07:44:03,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-02-08 07:44:03,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:44:03,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 07:44:03,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:04,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139653643] [2025-02-08 07:44:04,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139653643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:04,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:04,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:44:04,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410282975] [2025-02-08 07:44:04,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:04,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:44:04,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:04,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:44:04,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:04,001 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:04,076 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2025-02-08 07:44:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:44:04,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 07:44:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:04,077 INFO L225 Difference]: With dead ends: 115 [2025-02-08 07:44:04,077 INFO L226 Difference]: Without dead ends: 115 [2025-02-08 07:44:04,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:04,078 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 131 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:04,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:04,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-08 07:44:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2025-02-08 07:44:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 96 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2025-02-08 07:44:04,085 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 17 [2025-02-08 07:44:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:04,085 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2025-02-08 07:44:04,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2025-02-08 07:44:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:44:04,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:04,086 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:44:04,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:44:04,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:04,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash 73071851, now seen corresponding path program 1 times [2025-02-08 07:44:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369778612] [2025-02-08 07:44:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:04,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:44:04,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:44:04,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:04,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369778612] [2025-02-08 07:44:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369778612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824230553] [2025-02-08 07:44:04,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:04,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:04,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:04,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:44:04,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:44:04,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:44:04,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:04,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:04,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:44:04,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:04,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:04,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824230553] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:04,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:04,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:44:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503795147] [2025-02-08 07:44:04,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:04,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:44:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:04,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:44:04,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:44:04,695 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:04,774 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2025-02-08 07:44:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:44:04,775 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 17 [2025-02-08 07:44:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:04,776 INFO L225 Difference]: With dead ends: 117 [2025-02-08 07:44:04,776 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 07:44:04,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-02-08 07:44:04,776 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:04,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 438 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 07:44:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-08 07:44:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 80 states have (on average 1.4875) internal successors, (119), 114 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2025-02-08 07:44:04,784 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 17 [2025-02-08 07:44:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:04,784 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2025-02-08 07:44:04,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2025-02-08 07:44:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:44:04,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:04,785 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-02-08 07:44:04,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 07:44:04,985 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-02-08 07:44:04,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:04,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1391539947, now seen corresponding path program 2 times [2025-02-08 07:44:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877275178] [2025-02-08 07:44:04,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:44:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:05,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 07:44:05,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-02-08 07:44:05,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:44:05,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:05,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877275178] [2025-02-08 07:44:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877275178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:44:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532056951] [2025-02-08 07:44:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:05,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:44:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:05,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:44:05,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:05,259 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:05,309 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2025-02-08 07:44:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:44:05,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 07:44:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:05,310 INFO L225 Difference]: With dead ends: 116 [2025-02-08 07:44:05,310 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 07:44:05,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:05,311 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:05,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:44:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 07:44:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-08 07:44:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.475) internal successors, (118), 113 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2025-02-08 07:44:05,316 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 35 [2025-02-08 07:44:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:05,317 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2025-02-08 07:44:05,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2025-02-08 07:44:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:44:05,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:05,318 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:05,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:44:05,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:05,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash 591418000, now seen corresponding path program 1 times [2025-02-08 07:44:05,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:05,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177552343] [2025-02-08 07:44:05,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:05,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:05,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:44:05,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:44:05,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:05,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177552343] [2025-02-08 07:44:05,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177552343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:05,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:05,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:44:05,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713572579] [2025-02-08 07:44:05,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:05,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:44:05,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:05,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:44:05,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:05,643 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:05,719 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2025-02-08 07:44:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:44:05,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2025-02-08 07:44:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:05,721 INFO L225 Difference]: With dead ends: 127 [2025-02-08 07:44:05,721 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 07:44:05,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:05,722 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:05,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 87 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 07:44:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2025-02-08 07:44:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.4125) internal successors, (113), 108 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2025-02-08 07:44:05,730 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 43 [2025-02-08 07:44:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:05,731 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2025-02-08 07:44:05,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2025-02-08 07:44:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:44:05,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:05,732 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:05,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:44:05,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:05,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 591418001, now seen corresponding path program 1 times [2025-02-08 07:44:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438804067] [2025-02-08 07:44:05,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:05,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:44:05,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:44:05,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:05,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:06,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438804067] [2025-02-08 07:44:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438804067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:06,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:06,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:44:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221985253] [2025-02-08 07:44:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:06,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:44:06,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:06,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:44:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:44:06,438 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:06,565 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2025-02-08 07:44:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:44:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2025-02-08 07:44:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:06,566 INFO L225 Difference]: With dead ends: 127 [2025-02-08 07:44:06,566 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 07:44:06,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:44:06,567 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 70 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:06,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 290 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 07:44:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2025-02-08 07:44:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.4) internal successors, (112), 107 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-02-08 07:44:06,575 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 43 [2025-02-08 07:44:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:06,576 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-02-08 07:44:06,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-02-08 07:44:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:44:06,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:06,577 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:06,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:44:06,577 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 978040010, now seen corresponding path program 1 times [2025-02-08 07:44:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778079357] [2025-02-08 07:44:06,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:06,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:44:06,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:44:06,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:06,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778079357] [2025-02-08 07:44:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778079357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:07,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:44:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058338448] [2025-02-08 07:44:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:07,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:44:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:07,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:44:07,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:44:07,002 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:07,111 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2025-02-08 07:44:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:44:07,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-02-08 07:44:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:07,113 INFO L225 Difference]: With dead ends: 144 [2025-02-08 07:44:07,113 INFO L226 Difference]: Without dead ends: 144 [2025-02-08 07:44:07,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:44:07,114 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 177 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:07,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 111 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-08 07:44:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2025-02-08 07:44:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 120 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2025-02-08 07:44:07,122 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 46 [2025-02-08 07:44:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:07,122 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2025-02-08 07:44:07,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2025-02-08 07:44:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:44:07,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:07,124 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:07,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:44:07,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:07,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash 978039081, now seen corresponding path program 1 times [2025-02-08 07:44:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:07,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440573153] [2025-02-08 07:44:07,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:07,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:44:07,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:44:07,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:07,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:07,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:07,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440573153] [2025-02-08 07:44:07,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440573153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:07,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:07,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:44:07,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128322913] [2025-02-08 07:44:07,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:07,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:44:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:07,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:44:07,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:07,396 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:07,518 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2025-02-08 07:44:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:44:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-02-08 07:44:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:07,520 INFO L225 Difference]: With dead ends: 138 [2025-02-08 07:44:07,520 INFO L226 Difference]: Without dead ends: 138 [2025-02-08 07:44:07,520 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-02-08 07:44:07,522 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:07,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 131 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-08 07:44:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2025-02-08 07:44:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 119 states have internal predecessors, (132), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2025-02-08 07:44:07,528 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 46 [2025-02-08 07:44:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:07,529 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2025-02-08 07:44:07,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2025-02-08 07:44:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:44:07,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:07,531 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:07,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:44:07,531 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:07,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash 978039082, now seen corresponding path program 1 times [2025-02-08 07:44:07,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:07,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663521551] [2025-02-08 07:44:07,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:07,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:44:07,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:44:07,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:07,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663521551] [2025-02-08 07:44:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663521551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:07,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:07,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:44:07,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905244951] [2025-02-08 07:44:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:07,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:44:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:07,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:44:07,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:44:07,864 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:07,955 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2025-02-08 07:44:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:44:07,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-02-08 07:44:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:07,956 INFO L225 Difference]: With dead ends: 127 [2025-02-08 07:44:07,956 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 07:44:07,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:44:07,957 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 88 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 264 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-02-08 07:44:07,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 264 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 07:44:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2025-02-08 07:44:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 119 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2025-02-08 07:44:07,963 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 46 [2025-02-08 07:44:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:07,964 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2025-02-08 07:44:07,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2025-02-08 07:44:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:44:07,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:07,966 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:07,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:44:07,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash -267982773, now seen corresponding path program 1 times [2025-02-08 07:44:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:07,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045484218] [2025-02-08 07:44:07,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:08,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:44:08,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:44:08,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:08,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:08,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:08,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045484218] [2025-02-08 07:44:08,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045484218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:08,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:08,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:44:08,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648761052] [2025-02-08 07:44:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:08,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:44:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:08,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:44:08,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:08,252 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:08,321 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2025-02-08 07:44:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:44:08,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-08 07:44:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:08,322 INFO L225 Difference]: With dead ends: 127 [2025-02-08 07:44:08,323 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 07:44:08,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:08,323 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:08,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 83 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 07:44:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-02-08 07:44:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.393939393939394) internal successors, (138), 123 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2025-02-08 07:44:08,332 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 49 [2025-02-08 07:44:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:08,332 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2025-02-08 07:44:08,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2025-02-08 07:44:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:44:08,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:08,333 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:08,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:44:08,333 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash -267982772, now seen corresponding path program 1 times [2025-02-08 07:44:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081255362] [2025-02-08 07:44:08,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:08,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:44:08,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:44:08,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:08,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081255362] [2025-02-08 07:44:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081255362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:09,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:09,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:44:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490379447] [2025-02-08 07:44:09,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:09,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:44:09,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:09,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:44:09,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:44:09,002 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:09,184 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2025-02-08 07:44:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:44:09,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-08 07:44:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:09,186 INFO L225 Difference]: With dead ends: 136 [2025-02-08 07:44:09,186 INFO L226 Difference]: Without dead ends: 136 [2025-02-08 07:44:09,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:44:09,187 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 93 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:09,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 158 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-08 07:44:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2025-02-08 07:44:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 123 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2025-02-08 07:44:09,191 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 49 [2025-02-08 07:44:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:09,192 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2025-02-08 07:44:09,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2025-02-08 07:44:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:44:09,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:09,192 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:09,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:44:09,193 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 869651042, now seen corresponding path program 1 times [2025-02-08 07:44:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353629153] [2025-02-08 07:44:09,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:09,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:44:09,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:44:09,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:09,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:09,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353629153] [2025-02-08 07:44:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353629153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:09,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:44:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686606586] [2025-02-08 07:44:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:09,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:44:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:09,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:44:09,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:44:09,657 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:09,803 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2025-02-08 07:44:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:44:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-02-08 07:44:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:09,804 INFO L225 Difference]: With dead ends: 125 [2025-02-08 07:44:09,804 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 07:44:09,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:44:09,805 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:09,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 211 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 07:44:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-02-08 07:44:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 122 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2025-02-08 07:44:09,809 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 52 [2025-02-08 07:44:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2025-02-08 07:44:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2025-02-08 07:44:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:44:09,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:09,810 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:44:09,810 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:09,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 869651043, now seen corresponding path program 1 times [2025-02-08 07:44:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196253717] [2025-02-08 07:44:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:09,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:44:09,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:44:09,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:09,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:10,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:10,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196253717] [2025-02-08 07:44:10,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196253717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:10,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:10,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:44:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894979101] [2025-02-08 07:44:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:10,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:44:10,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:10,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:44:10,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:44:10,591 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:10,736 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2025-02-08 07:44:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:44:10,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-02-08 07:44:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:10,738 INFO L225 Difference]: With dead ends: 124 [2025-02-08 07:44:10,738 INFO L226 Difference]: Without dead ends: 124 [2025-02-08 07:44:10,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:44:10,738 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 40 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:10,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 223 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-08 07:44:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-08 07:44:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 121 states have internal predecessors, (132), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2025-02-08 07:44:10,741 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 52 [2025-02-08 07:44:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:10,742 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2025-02-08 07:44:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2025-02-08 07:44:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 07:44:10,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:10,743 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:44:10,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -697360298, now seen corresponding path program 1 times [2025-02-08 07:44:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880290557] [2025-02-08 07:44:10,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:10,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 07:44:10,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 07:44:10,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:10,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:10,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:10,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880290557] [2025-02-08 07:44:10,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880290557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:44:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858148857] [2025-02-08 07:44:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:10,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:44:10,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:10,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:44:10,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:10,872 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:10,899 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2025-02-08 07:44:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:44:10,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-02-08 07:44:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:10,902 INFO L225 Difference]: With dead ends: 136 [2025-02-08 07:44:10,902 INFO L226 Difference]: Without dead ends: 136 [2025-02-08 07:44:10,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:44:10,902 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:10,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:44:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-08 07:44:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2025-02-08 07:44:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 123 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2025-02-08 07:44:10,906 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 56 [2025-02-08 07:44:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:10,906 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2025-02-08 07:44:10,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2025-02-08 07:44:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:44:10,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:10,907 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:10,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 07:44:10,907 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:10,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -143086207, now seen corresponding path program 1 times [2025-02-08 07:44:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404462994] [2025-02-08 07:44:10,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:10,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:44:10,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:44:10,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:10,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:11,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404462994] [2025-02-08 07:44:11,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404462994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:11,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:11,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 07:44:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722264389] [2025-02-08 07:44:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:11,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 07:44:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:11,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 07:44:11,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 07:44:11,578 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:11,808 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2025-02-08 07:44:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:44:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-08 07:44:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:11,809 INFO L225 Difference]: With dead ends: 139 [2025-02-08 07:44:11,809 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 07:44:11,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:44:11,810 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 66 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:11,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 220 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:44:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 07:44:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2025-02-08 07:44:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 129 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2025-02-08 07:44:11,814 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 57 [2025-02-08 07:44:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:11,815 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2025-02-08 07:44:11,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2025-02-08 07:44:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:44:11,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:11,815 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 07:44:11,816 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:11,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash -143086206, now seen corresponding path program 1 times [2025-02-08 07:44:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674515600] [2025-02-08 07:44:11,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:11,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:44:11,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:44:11,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:11,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:12,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674515600] [2025-02-08 07:44:12,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674515600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:12,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:12,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:44:12,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949582683] [2025-02-08 07:44:12,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:12,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:44:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:12,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:44:12,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:44:12,865 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:13,189 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2025-02-08 07:44:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 07:44:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-08 07:44:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:13,191 INFO L225 Difference]: With dead ends: 138 [2025-02-08 07:44:13,191 INFO L226 Difference]: Without dead ends: 138 [2025-02-08 07:44:13,191 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-02-08 07:44:13,192 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 68 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:13,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 295 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:44:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-08 07:44:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2025-02-08 07:44:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 129 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2025-02-08 07:44:13,196 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 57 [2025-02-08 07:44:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2025-02-08 07:44:13,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2025-02-08 07:44:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 07:44:13,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:13,198 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:13,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 07:44:13,198 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:13,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash 148716702, now seen corresponding path program 1 times [2025-02-08 07:44:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237759670] [2025-02-08 07:44:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:13,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:44:13,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:44:13,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:13,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237759670] [2025-02-08 07:44:13,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237759670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425337930] [2025-02-08 07:44:13,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:13,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:13,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:13,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:13,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:44:13,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:44:13,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:44:13,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:13,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:13,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:44:13,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:13,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:13,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425337930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:13,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:13,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:44:13,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233489281] [2025-02-08 07:44:13,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:13,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:44:13,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:13,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:44:13,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:44:13,820 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:13,867 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2025-02-08 07:44:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:44:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-02-08 07:44:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:13,870 INFO L225 Difference]: With dead ends: 161 [2025-02-08 07:44:13,870 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 07:44:13,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:44:13,872 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 19 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 233 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-02-08 07:44:13,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 233 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:44:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 07:44:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2025-02-08 07:44:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 153 states have internal predecessors, (175), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2025-02-08 07:44:13,885 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 61 [2025-02-08 07:44:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:13,885 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2025-02-08 07:44:13,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2025-02-08 07:44:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:44:13,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:13,886 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:13,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 07:44:14,086 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-02-08 07:44:14,087 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash 315497017, now seen corresponding path program 1 times [2025-02-08 07:44:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033621475] [2025-02-08 07:44:14,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:14,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:44:14,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:44:14,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:14,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033621475] [2025-02-08 07:44:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033621475] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894715540] [2025-02-08 07:44:14,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:14,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:14,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:44:15,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:44:15,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:44:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:15,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 07:44:15,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:15,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:44:15,273 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:44:15,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:44:15,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:44:15,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2025-02-08 07:44:15,394 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:44:15,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-08 07:44:15,457 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:44:15,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-08 07:44:15,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-08 07:44:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 07:44:15,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:15,573 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1794) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) is different from false [2025-02-08 07:44:15,595 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-02-08 07:44:15,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2025-02-08 07:44:15,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1793 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem143#1.base| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_1793))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1794)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) is different from false [2025-02-08 07:44:15,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1792)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_1793))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1794)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) is different from false [2025-02-08 07:44:15,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:15,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 80 [2025-02-08 07:44:15,697 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 13588 treesize of output 9900 [2025-02-08 07:44:15,730 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 66 treesize of output 48 [2025-02-08 07:44:15,733 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 98 treesize of output 62 [2025-02-08 07:44:15,737 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 62 treesize of output 50 [2025-02-08 07:44:15,824 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:44:15,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 07:44:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2025-02-08 07:44:15,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894715540] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:15,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:15,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2025-02-08 07:44:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352692733] [2025-02-08 07:44:15,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:15,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 07:44:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:15,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 07:44:15,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=269, Unknown=10, NotChecked=108, Total=462 [2025-02-08 07:44:15,836 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:16,282 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2025-02-08 07:44:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:44:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-08 07:44:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:16,284 INFO L225 Difference]: With dead ends: 161 [2025-02-08 07:44:16,284 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 07:44:16,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=385, Unknown=10, NotChecked=132, Total=650 [2025-02-08 07:44:16,285 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 59 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:16,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 438 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 359 Invalid, 0 Unknown, 227 Unchecked, 0.3s Time] [2025-02-08 07:44:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 07:44:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2025-02-08 07:44:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.2900763358778626) internal successors, (169), 152 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2025-02-08 07:44:16,295 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 62 [2025-02-08 07:44:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:16,295 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2025-02-08 07:44:16,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2025-02-08 07:44:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:44:16,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:16,296 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:16,308 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-02-08 07:44:16,497 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-02-08 07:44:16,497 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:16,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash 315497018, now seen corresponding path program 1 times [2025-02-08 07:44:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:16,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704269772] [2025-02-08 07:44:16,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:16,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:44:16,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:44:16,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:16,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:17,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:17,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704269772] [2025-02-08 07:44:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704269772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:17,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655752571] [2025-02-08 07:44:17,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:17,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:17,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:17,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:17,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:44:17,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:44:18,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:44:18,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:18,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:18,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 07:44:18,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:18,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:44:18,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:44:18,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:44:18,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:44:18,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 07:44:18,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:44:18,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 07:44:18,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 07:44:18,309 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:44:18,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:44:18,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:44:18,438 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:44:18,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:44:18,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:44:18,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-08 07:44:18,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 07:44:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:18,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:18,672 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_2026 (Array Int Int)) (v_ArrVal_2025 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2025) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2026 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))))) is different from false [2025-02-08 07:44:18,697 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_2026 (Array Int Int)) (v_ArrVal_2025 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2025) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2026 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-02-08 07:44:18,729 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_2026 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2025 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2025) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:44:18,753 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_2026 (Array Int Int)) (v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2024))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2023) .cse0 v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2025) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2023) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2024) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2025-02-08 07:44:18,774 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_2026 (Array Int Int)) (v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2024))) (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_2023) .cse1 v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2025) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2023) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2024) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)))))) is different from false [2025-02-08 07:44:18,817 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_2026 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2021 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2022))) (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_~mem_track~0#1.base| v_ArrVal_2021) .cse0 v_ArrVal_2023) (select (select (store .cse1 .cse0 v_ArrVal_2024) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2026))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_2026 (Array Int Int)) (v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2021 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2022))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2024))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2021) .cse3 v_ArrVal_2023) .cse4 v_ArrVal_2026) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2025) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:44:18,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:18,866 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-02-08 07:44:18,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:18,878 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-02-08 07:44:18,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38212 treesize of output 32204 [2025-02-08 07:44:19,294 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 17550 treesize of output 16870 [2025-02-08 07:44:19,443 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 3735 treesize of output 3501 [2025-02-08 07:44:19,472 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 3501 treesize of output 3327 [2025-02-08 07:44:19,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3327 treesize of output 3153 [2025-02-08 07:44:19,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3153 treesize of output 2493 [2025-02-08 07:44:19,551 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 2493 treesize of output 2085 [2025-02-08 07:44:19,594 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 2085 treesize of output 1989 [2025-02-08 07:44:31,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:31,265 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-02-08 07:44:31,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:31,276 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-02-08 07:44:31,279 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:44:31,282 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-02-08 07:44:31,284 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:44:31,285 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:44:31,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-02-08 07:44:31,355 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:44:31,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 07:44:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-02-08 07:44:31,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655752571] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:31,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:31,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-02-08 07:44:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660166354] [2025-02-08 07:44:31,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:31,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 07:44:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:31,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 07:44:31,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=562, Unknown=6, NotChecked=318, Total=992 [2025-02-08 07:44:31,369 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:32,246 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2025-02-08 07:44:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:44:32,247 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-08 07:44:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:32,248 INFO L225 Difference]: With dead ends: 161 [2025-02-08 07:44:32,248 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 07:44:32,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=873, Unknown=6, NotChecked=402, Total=1482 [2025-02-08 07:44:32,249 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 121 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 517 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:32,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 629 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 550 Invalid, 0 Unknown, 517 Unchecked, 0.4s Time] [2025-02-08 07:44:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 07:44:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2025-02-08 07:44:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 152 states have internal predecessors, (167), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2025-02-08 07:44:32,255 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 62 [2025-02-08 07:44:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:32,255 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2025-02-08 07:44:32,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2025-02-08 07:44:32,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 07:44:32,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:32,256 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:32,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 07:44:32,460 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-02-08 07:44:32,460 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:32,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1240981634, now seen corresponding path program 2 times [2025-02-08 07:44:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:32,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998228501] [2025-02-08 07:44:32,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:44:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:32,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 07:44:32,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 07:44:32,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:44:32,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:33,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998228501] [2025-02-08 07:44:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998228501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985611688] [2025-02-08 07:44:33,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:44:33,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:33,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:33,988 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:33,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:44:34,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 07:44:34,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 07:44:34,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:44:34,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:34,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 07:44:34,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:34,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:44:34,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:44:34,403 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:44:34,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:44:34,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:44:34,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 07:44:34,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 07:44:34,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 07:44:34,572 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:44:34,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:44:34,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:44:34,689 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:44:34,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:44:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:44:34,808 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:44:34,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:44:34,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:44:34,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-08 07:44:34,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 07:44:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:34,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:35,011 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_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2271) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2272 (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_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2025-02-08 07:44:35,024 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_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2271) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2272 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-02-08 07:44:35,036 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_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2271) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2272 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:44:35,045 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_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2269))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |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_2270) .cse0 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2271) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2272 (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_2270) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2269) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2025-02-08 07:44:35,069 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_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2269))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2270) .cse1 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2271) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2270) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2269) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2025-02-08 07:44:35,181 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_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2268))) (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_2267) .cse0 v_ArrVal_2270) (select (select (store .cse1 .cse0 v_ArrVal_2269) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2272))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2268))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2269))) (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_2267) .cse3 v_ArrVal_2270) .cse4 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2271) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:44:35,212 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_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2268))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2267) .cse1 v_ArrVal_2270) (select (select (store .cse2 .cse1 v_ArrVal_2269) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2272))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2268))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2269))) (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_2267) .cse4 v_ArrVal_2270) .cse5 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2271) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-02-08 07:44:35,267 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_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2266))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2268))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2269))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2265) .cse0 v_ArrVal_2267) .cse1 v_ArrVal_2270) .cse2 v_ArrVal_2272) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2271) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2266))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2268))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2265) .cse7 v_ArrVal_2267) .cse8 v_ArrVal_2270) (select (select (store .cse9 .cse8 v_ArrVal_2269) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2272))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))))) is different from false [2025-02-08 07:44:35,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:35,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2025-02-08 07:44:35,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:35,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2025-02-08 07:44:35,326 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 73752 treesize of output 62560 [2025-02-08 07:44:35,757 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 172194 treesize of output 168026 [2025-02-08 07:44:36,350 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 8461 treesize of output 7693 [2025-02-08 07:44:36,401 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 7693 treesize of output 6907 [2025-02-08 07:44:36,450 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 6907 treesize of output 6757 [2025-02-08 07:44:36,523 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 6757 treesize of output 5545 [2025-02-08 07:44:36,579 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 5545 treesize of output 5305 [2025-02-08 07:44:36,631 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 5305 treesize of output 4711 [2025-02-08 07:44:36,683 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 4711 treesize of output 4543 [2025-02-08 07:44:39,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:39,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 418 [2025-02-08 07:44:39,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:39,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 238 [2025-02-08 07:44:39,242 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:44:39,252 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 11674 treesize of output 7906 [2025-02-08 07:44:39,271 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:44:39,272 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:44:39,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-08 07:44:39,377 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:44:39,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 07:44:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 13 not checked. [2025-02-08 07:44:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985611688] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:39,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 38 [2025-02-08 07:44:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249525993] [2025-02-08 07:44:39,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 07:44:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:39,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 07:44:39,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=802, Unknown=9, NotChecked=520, Total=1482 [2025-02-08 07:44:39,388 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:40,331 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2025-02-08 07:44:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:44:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2025-02-08 07:44:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:40,333 INFO L225 Difference]: With dead ends: 161 [2025-02-08 07:44:40,333 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 07:44:40,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=1297, Unknown=9, NotChecked=664, Total=2256 [2025-02-08 07:44:40,334 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 92 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 737 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:40,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 658 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 619 Invalid, 0 Unknown, 737 Unchecked, 0.4s Time] [2025-02-08 07:44:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 07:44:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2025-02-08 07:44:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 152 states have internal predecessors, (165), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2025-02-08 07:44:40,339 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 67 [2025-02-08 07:44:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:40,339 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2025-02-08 07:44:40,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2025-02-08 07:44:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 07:44:40,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:40,340 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:44:40,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 07:44:40,540 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-02-08 07:44:40,541 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-02-08 07:44:40,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2128004922, now seen corresponding path program 3 times [2025-02-08 07:44:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592634300] [2025-02-08 07:44:40,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:44:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:40,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-02-08 07:44:40,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 72 statements. [2025-02-08 07:44:40,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 07:44:40,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:42,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592634300] [2025-02-08 07:44:42,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592634300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:42,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872927228] [2025-02-08 07:44:42,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:44:42,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:42,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:42,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:44:42,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-02-08 07:44:43,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 72 statements. [2025-02-08 07:44:43,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 07:44:43,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:43,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 07:44:43,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:43,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:44:43,184 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:44:43,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:44:43,190 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-02-08 07:44:43,240 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 11 treesize of output 7 [2025-02-08 07:44:43,248 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 15 treesize of output 1 [2025-02-08 07:44:43,322 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 16 treesize of output 11 [2025-02-08 07:44:43,329 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 26 treesize of output 19 [2025-02-08 07:44:43,426 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 07:44:43,426 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 45 [2025-02-08 07:44:43,433 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 24 treesize of output 11 [2025-02-08 07:44:43,577 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 07:44:43,577 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 45 [2025-02-08 07:44:43,586 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 24 treesize of output 11 [2025-02-08 07:44:43,707 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 07:44:43,707 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 45 [2025-02-08 07:44:43,713 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 24 treesize of output 11 [2025-02-08 07:44:43,831 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 07:44:43,831 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 45 [2025-02-08 07:44:43,842 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 24 treesize of output 11 [2025-02-08 07:44:43,938 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 25 treesize of output 13 [2025-02-08 07:44:43,943 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 7 treesize of output 3 [2025-02-08 07:44:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:43,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:44,516 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2529))) (or (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2530))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store .cse0 .cse1 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1) 0)))) (forall ((v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2529))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((v_ArrVal_2532 (Array Int Int))) (< .cse5 (+ 2 (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2530) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse5 1) 0)))))))) is different from false [2025-02-08 07:44:44,560 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 ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse0) 0) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2530) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2529))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) 0) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2530))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store .cse4 .cse5 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-02-08 07:44:44,582 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_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2527))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2528) .cse5 v_ArrVal_2529))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2530))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store .cse0 .cse1 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0)))))) (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2527))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2528) .cse9 v_ArrVal_2529))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse6 (+ 2 (select (select (store .cse7 (select (select (store .cse8 .cse9 v_ArrVal_2530) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse6) 0))))))))) is different from false [2025-02-08 07:44:44,624 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 ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2527))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2528) .cse5 v_ArrVal_2529))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2530))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_2532) |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_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2) 0)))))) (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2527))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2528) .cse10 v_ArrVal_2529))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< (+ .cse7 |c_ULTIMATE.start_main_~j~0#1| 2) 0) (< .cse7 (+ (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_2530) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))))))))))) is different from false [2025-02-08 07:44:44,801 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_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2526))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse6 .cse5 v_ArrVal_2527))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2525) .cse5 v_ArrVal_2528) .cse3 v_ArrVal_2529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ 2 .cse0) 0) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2530) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))) (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2526))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_2527))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2525) .cse12 v_ArrVal_2528) .cse11 v_ArrVal_2529))) (or (let ((.cse9 (store .cse10 .cse11 v_ArrVal_2530))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ 3 (select (select (store .cse7 .cse8 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))) (< (+ 2 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) 0)))))))))) is different from false [2025-02-08 07:44:44,846 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 ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_2526))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse7 .cse6 v_ArrVal_2527))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2525) .cse6 v_ArrVal_2528) .cse3 v_ArrVal_2529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ 2 .cse0) 0) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2530) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))) (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_2526))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_2527))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2525) .cse13 v_ArrVal_2528) .cse12 v_ArrVal_2529))) (or (< (+ 2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) 0) (let ((.cse10 (store .cse11 .cse12 v_ArrVal_2530))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ 3 (select (select (store .cse8 .cse9 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))))) is different from false [2025-02-08 07:44:48,986 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_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2524))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_2526))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse7 .cse6 v_ArrVal_2527))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2523) .cse5 v_ArrVal_2525) .cse6 v_ArrVal_2528) .cse3 v_ArrVal_2529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ 2 .cse0) 0) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2530) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2524))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_2526))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_2527))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2523) .cse14 v_ArrVal_2525) .cse15 v_ArrVal_2528) .cse13 v_ArrVal_2529))) (or (< (+ 2 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) 0) (let ((.cse11 (store .cse12 .cse13 v_ArrVal_2530))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ 3 (select (select (store .cse9 .cse10 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))))) is different from false [2025-02-08 07:44:49,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:49,078 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 1044 treesize of output 1032 [2025-02-08 07:44:49,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:44:49,089 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 1020 treesize of output 576 [2025-02-08 07:44:49,569 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 29190022 treesize of output 24926174 [2025-02-08 07:44:52,001 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 3557919 treesize of output 3532991 [2025-02-08 07:44:52,658 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 5647 treesize of output 5455 [2025-02-08 07:44:52,685 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 5782 treesize of output 5572 [2025-02-08 07:44:52,720 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 5263 treesize of output 4951 [2025-02-08 07:44:52,748 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 5260 treesize of output 4996 [2025-02-08 07:44:52,776 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 4996 treesize of output 4480 [2025-02-08 07:44:52,806 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 4231 treesize of output 3463 [2025-02-08 07:44:52,832 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 3712 treesize of output 3082 [2025-02-08 07:44:52,885 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 3021 treesize of output 2631 [2025-02-08 07:44:52,925 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 2692 treesize of output 2632 [2025-02-08 07:44:52,954 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 2577 treesize of output 2547 [2025-02-08 07:45:03,716 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 07:45:03,717 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 834 treesize of output 1 [2025-02-08 07:45:03,884 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:45:03,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 07:45:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 145 trivial. 18 not checked. [2025-02-08 07:45:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872927228] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:45:03,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:45:03,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 52 [2025-02-08 07:45:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686504632] [2025-02-08 07:45:03,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:45:03,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-08 07:45:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:45:03,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-08 07:45:03,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1821, Unknown=23, NotChecked=658, Total=2756 [2025-02-08 07:45:03,896 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 53 states, 52 states have (on average 2.076923076923077) internal successors, (108), 52 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:45:06,844 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$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 1))) (let ((.cse2 (< .cse4 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (<= 1 |c_ULTIMATE.start_main_~argc~0#1|) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse0) (select |c_#length| .cse1)) (or .cse2 (forall ((v_ArrVal_2532 (Array Int Int))) (< .cse0 (+ 2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))) (<= |c_ULTIMATE.start_main_~argc~0#1| 10000) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|)) (<= 0 .cse4) (= 0 |c_ULTIMATE.start_main_~argv~0#1.offset|) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|) 1) (or .cse2 (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) is different from false [2025-02-08 07:45:07,154 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 ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem144#1.offset| |c_ULTIMATE.start_main_~j~0#1|)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| .cse1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (<= 0 .cse0) (<= (+ |c_ULTIMATE.start_main_~j~0#1| .cse1 1) (select |c_#length| .cse2)) (or (< .cse0 0) (and (forall ((v_ArrVal_2532 (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_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1))) (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (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_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (<= 0 .cse4) (<= (+ |c_ULTIMATE.start_main_#t~mem144#1.offset| |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| |c_ULTIMATE.start_main_#t~mem144#1.base|)) (or (< .cse4 0) (and (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (forall ((v_ArrVal_2532 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1))))))))) is different from false [2025-02-08 07:45:09,390 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$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~j~0#1| .cse0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (<= 1 |c_ULTIMATE.start_main_~argc~0#1|) (<= (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 1) (select |c_#length| .cse1)) (<= 0 .cse2) (<= |c_ULTIMATE.start_main_~argc~0#1| 10000) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|)) (or (< .cse2 0) (and (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2531) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (forall ((v_ArrVal_2532 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2532) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1))))) (= 0 |c_ULTIMATE.start_main_~argv~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|) 1))))) is different from false [2025-02-08 07:45:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:45:09,397 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2025-02-08 07:45:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-08 07:45:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.076923076923077) internal successors, (108), 52 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2025-02-08 07:45:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:45:09,399 INFO L225 Difference]: With dead ends: 252 [2025-02-08 07:45:09,399 INFO L226 Difference]: Without dead ends: 252 [2025-02-08 07:45:09,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 116 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1024, Invalid=4809, Unknown=59, NotChecked=1590, Total=7482 [2025-02-08 07:45:09,401 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 464 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 53 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 2470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 1335 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:45:09,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1179 Invalid, 2470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1057 Invalid, 25 Unknown, 1335 Unchecked, 1.8s Time] [2025-02-08 07:45:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-08 07:45:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 211. [2025-02-08 07:45:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 187 states have (on average 1.267379679144385) internal successors, (237), 208 states have internal predecessors, (237), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:45:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 239 transitions. [2025-02-08 07:45:09,407 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 239 transitions. Word has length 72 [2025-02-08 07:45:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:45:09,407 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 239 transitions. [2025-02-08 07:45:09,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.076923076923077) internal successors, (108), 52 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:45:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 239 transitions. [2025-02-08 07:45:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:45:09,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:45:09,410 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:45:09,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0