./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/uthash-2.0.2/uthash_FNV_test5-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:51:52,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:51:52,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 07:51:52,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:51:52,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:51:52,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:51:52,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:51:52,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:51:52,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:51:52,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:51:52,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:51:52,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:51:52,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:51:52,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:51:52,490 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:51:52,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:51:52,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 07:51:52,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:51:52,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 07:51:52,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:51:52,490 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:51:52,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:51:52,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:51:52,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:51:52,491 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c [2025-02-08 07:51:52,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:51:52,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:51:52,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:51:52,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:51:52,694 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:51:52,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2025-02-08 07:51:53,880 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb937e8bd/cbefe820864448b79bd5f374e297c551/FLAGc55a61bd6 [2025-02-08 07:51:54,157 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:51:54,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2025-02-08 07:51:54,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb937e8bd/cbefe820864448b79bd5f374e297c551/FLAGc55a61bd6 [2025-02-08 07:51:54,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb937e8bd/cbefe820864448b79bd5f374e297c551 [2025-02-08 07:51:54,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:51:54,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:51:54,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:51:54,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:51:54,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:51:54,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1722ded4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54, skipping insertion in model container [2025-02-08 07:51:54,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:51:54,455 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:51:54,474 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:51:54,476 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:51:54,479 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:51:54,483 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:51:54,503 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:51:54,504 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:51:54,506 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:51:54,509 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:51:54,541 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:51:54,541 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:51:54,543 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:51:54,543 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:51:54,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:51:54,568 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:51:54,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:51:54,717 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:51:54,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54 WrapperNode [2025-02-08 07:51:54,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:51:54,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:51:54,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:51:54,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:51:54,723 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:51:54" (1/1) ... [2025-02-08 07:51:54,751 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:51:54" (1/1) ... [2025-02-08 07:51:54,802 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1990 [2025-02-08 07:51:54,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:51:54,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:51:54,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:51:54,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:51:54,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,883 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-02-08 07:51:54,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:51:54,967 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:51:54,967 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:51:54,967 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:51:54,968 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (1/1) ... [2025-02-08 07:51:54,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:51:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:51:54,999 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:51:55,005 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:51:55,019 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 07:51:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 07:51:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 07:51:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 07:51:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 07:51:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 07:51:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 07:51:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:51:55,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:51:55,205 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:51:55,207 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:51:57,090 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-02-08 07:51:57,238 INFO L? ?]: Removed 1733 outVars from TransFormulas that were not future-live. [2025-02-08 07:51:57,238 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:51:57,321 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:51:57,321 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 07:51:57,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:51:57 BoogieIcfgContainer [2025-02-08 07:51:57,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:51:57,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:51:57,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:51:57,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:51:57,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:51:54" (1/3) ... [2025-02-08 07:51:57,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d52d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:51:57, skipping insertion in model container [2025-02-08 07:51:57,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:51:54" (2/3) ... [2025-02-08 07:51:57,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d52d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:51:57, skipping insertion in model container [2025-02-08 07:51:57,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:51:57" (3/3) ... [2025-02-08 07:51:57,328 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-1.i [2025-02-08 07:51:57,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:51:57,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test5-1.i that has 6 procedures, 1755 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2025-02-08 07:51:57,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:51:57,407 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;@69089c13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:51:57,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2025-02-08 07:51:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 1745 states, 1021 states have (on average 2.020568070519099) internal successors, (2063), 1734 states have internal predecessors, (2063), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 07:51:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:51:57,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:57,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:51:57,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:51:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 65704335, now seen corresponding path program 1 times [2025-02-08 07:51:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750900198] [2025-02-08 07:51:57,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:57,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:51:57,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:51:57,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:57,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:57,561 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:51:57,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:57,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750900198] [2025-02-08 07:51:57,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750900198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:51:57,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:51:57,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:51:57,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935904550] [2025-02-08 07:51:57,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:51:57,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:51:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:57,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:51:57,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:51:57,606 INFO L87 Difference]: Start difference. First operand has 1745 states, 1021 states have (on average 2.020568070519099) internal successors, (2063), 1734 states have internal predecessors, (2063), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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:51:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:57,951 INFO L93 Difference]: Finished difference Result 3432 states and 3950 transitions. [2025-02-08 07:51:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:51:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-08 07:51:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:57,971 INFO L225 Difference]: With dead ends: 3432 [2025-02-08 07:51:57,971 INFO L226 Difference]: Without dead ends: 3426 [2025-02-08 07:51:57,973 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:51:57,974 INFO L435 NwaCegarLoop]: 2223 mSDtfsCounter, 1941 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1952 SdHoareTripleChecker+Valid, 4134 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:57,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1952 Valid, 4134 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:51:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2025-02-08 07:51:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 1722. [2025-02-08 07:51:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1012 states have (on average 1.934782608695652) internal successors, (1958), 1712 states have internal predecessors, (1958), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:51:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 1977 transitions. [2025-02-08 07:51:58,057 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 1977 transitions. Word has length 4 [2025-02-08 07:51:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:58,058 INFO L471 AbstractCegarLoop]: Abstraction has 1722 states and 1977 transitions. [2025-02-08 07:51:58,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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:51:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 1977 transitions. [2025-02-08 07:51:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:51:58,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:58,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:51:58,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:51:58,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:51:58,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:58,060 INFO L85 PathProgramCache]: Analyzing trace with hash 67385149, now seen corresponding path program 1 times [2025-02-08 07:51:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:58,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49220445] [2025-02-08 07:51:58,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:58,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:58,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:51:58,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:51:58,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:58,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:58,114 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:51:58,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:58,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49220445] [2025-02-08 07:51:58,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49220445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:51:58,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:51:58,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:51:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118403367] [2025-02-08 07:51:58,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:51:58,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:51:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:58,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:51:58,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:51:58,116 INFO L87 Difference]: Start difference. First operand 1722 states and 1977 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:51:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:58,985 INFO L93 Difference]: Finished difference Result 1630 states and 1885 transitions. [2025-02-08 07:51:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:51:58,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 07:51:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:58,990 INFO L225 Difference]: With dead ends: 1630 [2025-02-08 07:51:58,990 INFO L226 Difference]: Without dead ends: 1630 [2025-02-08 07:51:58,990 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:51:58,991 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 1744 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:58,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 1129 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 07:51:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-02-08 07:51:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2025-02-08 07:51:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1012 states have (on average 1.8438735177865613) internal successors, (1866), 1620 states have internal predecessors, (1866), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:51:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1885 transitions. [2025-02-08 07:51:59,011 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 1885 transitions. Word has length 4 [2025-02-08 07:51:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:59,011 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 1885 transitions. [2025-02-08 07:51:59,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:51:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1885 transitions. [2025-02-08 07:51:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:51:59,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:59,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:51:59,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:51:59,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr710REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:51:59,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash 67385150, now seen corresponding path program 1 times [2025-02-08 07:51:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711869649] [2025-02-08 07:51:59,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:59,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:51:59,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:51:59,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:59,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:59,064 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:51:59,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711869649] [2025-02-08 07:51:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711869649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:51:59,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:51:59,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:51:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422981019] [2025-02-08 07:51:59,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:51:59,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:51:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:59,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:51:59,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:51:59,065 INFO L87 Difference]: Start difference. First operand 1630 states and 1885 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:52:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:00,148 INFO L93 Difference]: Finished difference Result 2372 states and 2786 transitions. [2025-02-08 07:52:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:52:00,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 07:52:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:00,165 INFO L225 Difference]: With dead ends: 2372 [2025-02-08 07:52:00,165 INFO L226 Difference]: Without dead ends: 2372 [2025-02-08 07:52:00,165 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:52:00,166 INFO L435 NwaCegarLoop]: 1483 mSDtfsCounter, 1222 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:00,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2366 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:52:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2025-02-08 07:52:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1898. [2025-02-08 07:52:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1290 states have (on average 1.817829457364341) internal successors, (2345), 1888 states have internal predecessors, (2345), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2364 transitions. [2025-02-08 07:52:00,231 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2364 transitions. Word has length 4 [2025-02-08 07:52:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:00,231 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2364 transitions. [2025-02-08 07:52:00,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:52:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2364 transitions. [2025-02-08 07:52:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 07:52:00,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:00,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:00,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:52:00,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr705REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:00,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1665836906, now seen corresponding path program 1 times [2025-02-08 07:52:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:00,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848646666] [2025-02-08 07:52:00,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:00,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 07:52:00,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 07:52:00,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:00,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:00,383 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:52:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848646666] [2025-02-08 07:52:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848646666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:00,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:52:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337929736] [2025-02-08 07:52:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:00,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:52:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:00,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:52:00,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:52:00,384 INFO L87 Difference]: Start difference. First operand 1898 states and 2364 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:52:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:01,309 INFO L93 Difference]: Finished difference Result 1924 states and 2417 transitions. [2025-02-08 07:52:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:52:01,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-02-08 07:52:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:01,314 INFO L225 Difference]: With dead ends: 1924 [2025-02-08 07:52:01,315 INFO L226 Difference]: Without dead ends: 1924 [2025-02-08 07:52:01,315 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:52:01,315 INFO L435 NwaCegarLoop]: 1096 mSDtfsCounter, 2011 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:01,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 2062 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 07:52:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2025-02-08 07:52:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1875. [2025-02-08 07:52:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1290 states have (on average 1.8) internal successors, (2322), 1865 states have internal predecessors, (2322), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2341 transitions. [2025-02-08 07:52:01,356 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2341 transitions. Word has length 10 [2025-02-08 07:52:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:01,356 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2341 transitions. [2025-02-08 07:52:01,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:52:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2341 transitions. [2025-02-08 07:52:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 07:52:01,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:01,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:01,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:52:01,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr706REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1665836905, now seen corresponding path program 1 times [2025-02-08 07:52:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6292928] [2025-02-08 07:52:01,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:01,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 07:52:01,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 07:52:01,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:01,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:01,413 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:52:01,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:01,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6292928] [2025-02-08 07:52:01,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6292928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:01,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:01,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:52:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885708016] [2025-02-08 07:52:01,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:01,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:52:01,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:01,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:52:01,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:52:01,415 INFO L87 Difference]: Start difference. First operand 1875 states and 2341 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:52:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:01,502 INFO L93 Difference]: Finished difference Result 1800 states and 2238 transitions. [2025-02-08 07:52:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:52:01,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-02-08 07:52:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:01,507 INFO L225 Difference]: With dead ends: 1800 [2025-02-08 07:52:01,507 INFO L226 Difference]: Without dead ends: 1800 [2025-02-08 07:52:01,507 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:52:01,508 INFO L435 NwaCegarLoop]: 1682 mSDtfsCounter, 60 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:01,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3311 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:52:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-02-08 07:52:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1800. [2025-02-08 07:52:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1227 states have (on average 1.8084759576202118) internal successors, (2219), 1790 states have internal predecessors, (2219), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2238 transitions. [2025-02-08 07:52:01,527 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2238 transitions. Word has length 10 [2025-02-08 07:52:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:01,528 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2238 transitions. [2025-02-08 07:52:01,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:52:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2238 transitions. [2025-02-08 07:52:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 07:52:01,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:01,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:01,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 07:52:01,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash -101459512, now seen corresponding path program 1 times [2025-02-08 07:52:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995433067] [2025-02-08 07:52:01,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:01,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 07:52:01,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 07:52:01,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:01,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:01,567 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:52:01,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:01,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995433067] [2025-02-08 07:52:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995433067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:01,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:01,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:52:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449527312] [2025-02-08 07:52:01,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:01,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:52:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:01,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:52:01,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:52:01,569 INFO L87 Difference]: Start difference. First operand 1800 states and 2238 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:52:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:01,697 INFO L93 Difference]: Finished difference Result 1782 states and 2213 transitions. [2025-02-08 07:52:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:52:01,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 07:52:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:01,701 INFO L225 Difference]: With dead ends: 1782 [2025-02-08 07:52:01,701 INFO L226 Difference]: Without dead ends: 1782 [2025-02-08 07:52:01,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:52:01,702 INFO L435 NwaCegarLoop]: 1647 mSDtfsCounter, 41 mSDsluCounter, 3266 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4913 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:01,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4913 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:52:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-02-08 07:52:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1779. [2025-02-08 07:52:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1213 states have (on average 1.806265457543281) internal successors, (2191), 1769 states have internal predecessors, (2191), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2210 transitions. [2025-02-08 07:52:01,720 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2210 transitions. Word has length 11 [2025-02-08 07:52:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:01,720 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2210 transitions. [2025-02-08 07:52:01,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:52:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2210 transitions. [2025-02-08 07:52:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 07:52:01,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:01,721 INFO L218 NwaCegarLoop]: trace histogram [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:52:01,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:52:01,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr668REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:01,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 374367070, now seen corresponding path program 1 times [2025-02-08 07:52:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:01,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343196849] [2025-02-08 07:52:01,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:01,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 07:52:01,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 07:52:01,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:01,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:01,834 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:52:01,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:01,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343196849] [2025-02-08 07:52:01,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343196849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:01,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:01,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:52:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855760807] [2025-02-08 07:52:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:01,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:52:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:01,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:52:01,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:52:01,835 INFO L87 Difference]: Start difference. First operand 1779 states and 2210 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:52:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:03,212 INFO L93 Difference]: Finished difference Result 2298 states and 2704 transitions. [2025-02-08 07:52:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:52:03,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 07:52:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:03,218 INFO L225 Difference]: With dead ends: 2298 [2025-02-08 07:52:03,218 INFO L226 Difference]: Without dead ends: 2298 [2025-02-08 07:52:03,219 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:52:03,219 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 1227 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:03,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3236 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 07:52:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2025-02-08 07:52:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1775. [2025-02-08 07:52:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1213 states have (on average 1.8029678483099754) internal successors, (2187), 1765 states have internal predecessors, (2187), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2206 transitions. [2025-02-08 07:52:03,239 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2206 transitions. Word has length 25 [2025-02-08 07:52:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:03,240 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2206 transitions. [2025-02-08 07:52:03,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:52:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2206 transitions. [2025-02-08 07:52:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 07:52:03,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:03,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:03,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:52:03,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:03,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1719315381, now seen corresponding path program 1 times [2025-02-08 07:52:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280363579] [2025-02-08 07:52:03,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:03,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:52:03,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:52:03,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:03,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:03,346 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:52:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:03,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280363579] [2025-02-08 07:52:03,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280363579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:03,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:03,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:52:03,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701353908] [2025-02-08 07:52:03,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:03,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:52:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:03,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:52:03,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:52:03,348 INFO L87 Difference]: Start difference. First operand 1775 states and 2206 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:52:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:03,461 INFO L93 Difference]: Finished difference Result 1775 states and 2202 transitions. [2025-02-08 07:52:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:52:03,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2025-02-08 07:52:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:03,466 INFO L225 Difference]: With dead ends: 1775 [2025-02-08 07:52:03,466 INFO L226 Difference]: Without dead ends: 1775 [2025-02-08 07:52:03,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:52:03,467 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 21 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4895 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:03,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4895 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:52:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2025-02-08 07:52:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2025-02-08 07:52:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1213 states have (on average 1.7996702390766695) internal successors, (2183), 1765 states have internal predecessors, (2183), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2202 transitions. [2025-02-08 07:52:03,490 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2202 transitions. Word has length 60 [2025-02-08 07:52:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:03,490 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2202 transitions. [2025-02-08 07:52:03,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:52:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2202 transitions. [2025-02-08 07:52:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 07:52:03,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:03,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:03,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:52:03,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:03,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2035829357, now seen corresponding path program 1 times [2025-02-08 07:52:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:03,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390930744] [2025-02-08 07:52:03,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:03,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 07:52:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 07:52:03,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:03,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:03,583 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:52:03,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390930744] [2025-02-08 07:52:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390930744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:52:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213628007] [2025-02-08 07:52:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:03,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:52:03,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:03,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:52:03,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:52:03,585 INFO L87 Difference]: Start difference. First operand 1775 states and 2202 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 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:52:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:03,686 INFO L93 Difference]: Finished difference Result 1867 states and 2321 transitions. [2025-02-08 07:52:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:52:03,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 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 68 [2025-02-08 07:52:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:03,690 INFO L225 Difference]: With dead ends: 1867 [2025-02-08 07:52:03,691 INFO L226 Difference]: Without dead ends: 1867 [2025-02-08 07:52:03,691 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:52:03,691 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 54 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3285 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:03,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3285 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:52:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2025-02-08 07:52:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1867. [2025-02-08 07:52:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1305 states have (on average 1.763984674329502) internal successors, (2302), 1857 states have internal predecessors, (2302), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2321 transitions. [2025-02-08 07:52:03,709 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2321 transitions. Word has length 68 [2025-02-08 07:52:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:03,709 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2321 transitions. [2025-02-08 07:52:03,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 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:52:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2321 transitions. [2025-02-08 07:52:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 07:52:03,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:03,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:03,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:52:03,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:03,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 158605529, now seen corresponding path program 1 times [2025-02-08 07:52:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585728141] [2025-02-08 07:52:03,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:03,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 07:52:03,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 07:52:03,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:03,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:04,072 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:52:04,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:04,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585728141] [2025-02-08 07:52:04,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585728141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:04,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:04,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:52:04,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671957659] [2025-02-08 07:52:04,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:04,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:52:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:04,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:52:04,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:52:04,073 INFO L87 Difference]: Start difference. First operand 1867 states and 2321 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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:52:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:05,163 INFO L93 Difference]: Finished difference Result 1783 states and 2237 transitions. [2025-02-08 07:52:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:52:05,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2025-02-08 07:52:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:05,167 INFO L225 Difference]: With dead ends: 1783 [2025-02-08 07:52:05,167 INFO L226 Difference]: Without dead ends: 1783 [2025-02-08 07:52:05,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:52:05,171 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 3059 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3065 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:05,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3065 Valid, 1495 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:52:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-02-08 07:52:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1505. [2025-02-08 07:52:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1027 states have (on average 1.6835443037974684) internal successors, (1729), 1495 states have internal predecessors, (1729), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1748 transitions. [2025-02-08 07:52:05,196 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1748 transitions. Word has length 71 [2025-02-08 07:52:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:05,197 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1748 transitions. [2025-02-08 07:52:05,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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:52:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1748 transitions. [2025-02-08 07:52:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:52:05,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:05,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:05,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:52:05,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr617REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:05,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 774032120, now seen corresponding path program 1 times [2025-02-08 07:52:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464150817] [2025-02-08 07:52:05,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:05,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:52:05,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:52:05,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:05,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:05,400 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:52:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464150817] [2025-02-08 07:52:05,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464150817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:05,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:05,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:52:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652596003] [2025-02-08 07:52:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:05,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:52:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:05,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:52:05,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:52:05,401 INFO L87 Difference]: Start difference. First operand 1505 states and 1748 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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:52:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:06,360 INFO L93 Difference]: Finished difference Result 1504 states and 1747 transitions. [2025-02-08 07:52:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:52:06,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-02-08 07:52:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:06,364 INFO L225 Difference]: With dead ends: 1504 [2025-02-08 07:52:06,364 INFO L226 Difference]: Without dead ends: 1504 [2025-02-08 07:52:06,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:52:06,365 INFO L435 NwaCegarLoop]: 1568 mSDtfsCounter, 2 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:06,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4561 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 07:52:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-02-08 07:52:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2025-02-08 07:52:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1027 states have (on average 1.6825705939629991) internal successors, (1728), 1494 states have internal predecessors, (1728), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1747 transitions. [2025-02-08 07:52:06,377 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1747 transitions. Word has length 76 [2025-02-08 07:52:06,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:06,377 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1747 transitions. [2025-02-08 07:52:06,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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:52:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1747 transitions. [2025-02-08 07:52:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:52:06,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:06,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:06,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:52:06,379 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr618REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:06,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:06,379 INFO L85 PathProgramCache]: Analyzing trace with hash 774032121, now seen corresponding path program 1 times [2025-02-08 07:52:06,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:06,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494618563] [2025-02-08 07:52:06,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:06,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:06,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:52:06,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:52:06,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:06,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:06,705 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:52:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:06,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494618563] [2025-02-08 07:52:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494618563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:06,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:06,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:52:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508030215] [2025-02-08 07:52:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:06,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:52:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:06,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:52:06,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:52:06,708 INFO L87 Difference]: Start difference. First operand 1504 states and 1747 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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:52:07,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:07,745 INFO L93 Difference]: Finished difference Result 1503 states and 1746 transitions. [2025-02-08 07:52:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:52:07,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-02-08 07:52:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:07,748 INFO L225 Difference]: With dead ends: 1503 [2025-02-08 07:52:07,748 INFO L226 Difference]: Without dead ends: 1503 [2025-02-08 07:52:07,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:52:07,749 INFO L435 NwaCegarLoop]: 1568 mSDtfsCounter, 1 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4583 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:07,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4583 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:52:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-02-08 07:52:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2025-02-08 07:52:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1026 states have (on average 1.6832358674463939) internal successors, (1727), 1493 states have internal predecessors, (1727), 13 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1746 transitions. [2025-02-08 07:52:07,761 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1746 transitions. Word has length 76 [2025-02-08 07:52:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:07,761 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1746 transitions. [2025-02-08 07:52:07,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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:52:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1746 transitions. [2025-02-08 07:52:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:52:07,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:07,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:07,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:52:07,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:07,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:07,763 INFO L85 PathProgramCache]: Analyzing trace with hash -99302251, now seen corresponding path program 1 times [2025-02-08 07:52:07,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:07,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89101317] [2025-02-08 07:52:07,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:07,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:07,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:52:07,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:52:07,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:07,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:07,909 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:52:07,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:07,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89101317] [2025-02-08 07:52:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89101317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:07,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:07,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:52:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857072108] [2025-02-08 07:52:07,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:07,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:52:07,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:07,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:52:07,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:52:07,911 INFO L87 Difference]: Start difference. First operand 1503 states and 1746 transitions. Second operand has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:52:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:09,143 INFO L93 Difference]: Finished difference Result 1515 states and 1764 transitions. [2025-02-08 07:52:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:52:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2025-02-08 07:52:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:09,154 INFO L225 Difference]: With dead ends: 1515 [2025-02-08 07:52:09,154 INFO L226 Difference]: Without dead ends: 1515 [2025-02-08 07:52:09,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:52:09,155 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 11 mSDsluCounter, 5628 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7180 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:09,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7180 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:52:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-02-08 07:52:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1509. [2025-02-08 07:52:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1031 states have (on average 1.6818622696411252) internal successors, (1734), 1498 states have internal predecessors, (1734), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-08 07:52:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1759 transitions. [2025-02-08 07:52:09,176 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1759 transitions. Word has length 84 [2025-02-08 07:52:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:09,176 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1759 transitions. [2025-02-08 07:52:09,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:52:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1759 transitions. [2025-02-08 07:52:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:52:09,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:09,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:09,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:52:09,179 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:09,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -99302250, now seen corresponding path program 1 times [2025-02-08 07:52:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:09,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139143778] [2025-02-08 07:52:09,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:09,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:52:09,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:52:09,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:09,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:09,555 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:52:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139143778] [2025-02-08 07:52:09,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139143778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:09,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:09,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:52:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190385165] [2025-02-08 07:52:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:09,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:52:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:09,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:52:09,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:52:09,557 INFO L87 Difference]: Start difference. First operand 1509 states and 1759 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:52:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:10,851 INFO L93 Difference]: Finished difference Result 1509 states and 1758 transitions. [2025-02-08 07:52:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:52:10,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2025-02-08 07:52:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:10,858 INFO L225 Difference]: With dead ends: 1509 [2025-02-08 07:52:10,860 INFO L226 Difference]: Without dead ends: 1509 [2025-02-08 07:52:10,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:52:10,861 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 6 mSDsluCounter, 4333 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5892 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:10,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5892 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2208 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:52:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-02-08 07:52:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2025-02-08 07:52:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1031 states have (on average 1.6808923375363725) internal successors, (1733), 1498 states have internal predecessors, (1733), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-08 07:52:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1758 transitions. [2025-02-08 07:52:10,882 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1758 transitions. Word has length 84 [2025-02-08 07:52:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:10,883 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1758 transitions. [2025-02-08 07:52:10,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:52:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1758 transitions. [2025-02-08 07:52:10,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 07:52:10,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:10,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:10,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:52:10,884 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:10,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1757492890, now seen corresponding path program 1 times [2025-02-08 07:52:10,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:10,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260793023] [2025-02-08 07:52:10,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:10,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:10,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:52:10,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:52:10,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:10,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:11,218 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:52:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260793023] [2025-02-08 07:52:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260793023] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006808452] [2025-02-08 07:52:11,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:52:11,224 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:52:11,227 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:52:11,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:52:11,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:52:11,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:11,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:11,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 07:52:11,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:52:11,422 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 6 treesize of output 5 [2025-02-08 07:52:11,500 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:52:11,500 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 11 treesize of output 11 [2025-02-08 07:52:11,507 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 19 treesize of output 1 [2025-02-08 07:52:11,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:11,548 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 42 treesize of output 41 [2025-02-08 07:52:11,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 31 treesize of output 13 [2025-02-08 07:52:11,571 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:52:11,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:52:11,604 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-08 07:52:11,604 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 21 treesize of output 20 [2025-02-08 07:52:11,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2025-02-08 07:52:11,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006808452] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:11,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:52:11,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-02-08 07:52:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730338813] [2025-02-08 07:52:11,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:52:11,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:52:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:11,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:52:11,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2025-02-08 07:52:11,612 INFO L87 Difference]: Start difference. First operand 1509 states and 1758 transitions. Second operand has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:52:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:14,154 INFO L93 Difference]: Finished difference Result 1508 states and 1757 transitions. [2025-02-08 07:52:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:52:14,154 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2025-02-08 07:52:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:14,157 INFO L225 Difference]: With dead ends: 1508 [2025-02-08 07:52:14,158 INFO L226 Difference]: Without dead ends: 1508 [2025-02-08 07:52:14,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2025-02-08 07:52:14,159 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 1548 mSDsluCounter, 8745 mSDsCounter, 0 mSdLazyCounter, 6438 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 9737 SdHoareTripleChecker+Invalid, 6464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:14,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 9737 Invalid, 6464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6438 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 07:52:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-02-08 07:52:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2025-02-08 07:52:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1031 states have (on average 1.6799224054316197) internal successors, (1732), 1497 states have internal predecessors, (1732), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-08 07:52:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1757 transitions. [2025-02-08 07:52:14,177 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1757 transitions. Word has length 85 [2025-02-08 07:52:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:14,178 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1757 transitions. [2025-02-08 07:52:14,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:52:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1757 transitions. [2025-02-08 07:52:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 07:52:14,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:14,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:14,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 07:52:14,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 07:52:14,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:14,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1757492889, now seen corresponding path program 1 times [2025-02-08 07:52:14,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:14,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66403666] [2025-02-08 07:52:14,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:14,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:14,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:52:14,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:52:14,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:14,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:14,863 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:52:14,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:14,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66403666] [2025-02-08 07:52:14,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66403666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:14,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629671267] [2025-02-08 07:52:14,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:14,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:14,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:52:14,866 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:52:14,873 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:52:15,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:52:15,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:52:15,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:15,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:15,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 07:52:15,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:52:15,064 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 6 treesize of output 5 [2025-02-08 07:52:15,148 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:52:15,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:52:15,159 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 11 treesize of output 11 [2025-02-08 07:52:15,166 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:52:15,173 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 19 treesize of output 1 [2025-02-08 07:52:15,222 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 22 treesize of output 10 [2025-02-08 07:52:15,225 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 9 treesize of output 3 [2025-02-08 07:52:15,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:15,308 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 62 treesize of output 57 [2025-02-08 07:52:15,312 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 30 treesize of output 13 [2025-02-08 07:52:15,338 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 31 treesize of output 13 [2025-02-08 07:52:15,340 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 9 treesize of output 3 [2025-02-08 07:52:15,341 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:52:15,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:52:15,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:52:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629671267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:15,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:52:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-02-08 07:52:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564389537] [2025-02-08 07:52:15,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:52:15,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:52:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:15,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:52:15,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-08 07:52:15,412 INFO L87 Difference]: Start difference. First operand 1508 states and 1757 transitions. Second operand has 15 states, 12 states have (on average 10.583333333333334) internal successors, (127), 15 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:52:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:17,895 INFO L93 Difference]: Finished difference Result 1515 states and 1764 transitions. [2025-02-08 07:52:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:52:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.583333333333334) internal successors, (127), 15 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2025-02-08 07:52:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:17,898 INFO L225 Difference]: With dead ends: 1515 [2025-02-08 07:52:17,898 INFO L226 Difference]: Without dead ends: 1515 [2025-02-08 07:52:17,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-08 07:52:17,899 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1543 mSDsluCounter, 4959 mSDsCounter, 0 mSdLazyCounter, 5417 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 5956 SdHoareTripleChecker+Invalid, 5456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 5417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:17,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 5956 Invalid, 5456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 5417 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 07:52:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-02-08 07:52:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1506. [2025-02-08 07:52:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1030 states have (on average 1.6796116504854368) internal successors, (1730), 1495 states have internal predecessors, (1730), 13 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1749 transitions. [2025-02-08 07:52:17,911 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1749 transitions. Word has length 85 [2025-02-08 07:52:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:17,912 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1749 transitions. [2025-02-08 07:52:17,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.583333333333334) internal successors, (127), 15 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:52:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1749 transitions. [2025-02-08 07:52:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 07:52:17,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:17,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:17,922 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:52:18,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 07:52:18,117 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:18,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash 920825194, now seen corresponding path program 1 times [2025-02-08 07:52:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876635058] [2025-02-08 07:52:18,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:18,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 07:52:18,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 07:52:18,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:18,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:18,434 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:52:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876635058] [2025-02-08 07:52:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876635058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:18,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 07:52:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962205710] [2025-02-08 07:52:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:18,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:52:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:18,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:52:18,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:52:18,437 INFO L87 Difference]: Start difference. First operand 1506 states and 1749 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 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:52:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:20,548 INFO L93 Difference]: Finished difference Result 1519 states and 1768 transitions. [2025-02-08 07:52:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:52:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 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 87 [2025-02-08 07:52:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:20,551 INFO L225 Difference]: With dead ends: 1519 [2025-02-08 07:52:20,552 INFO L226 Difference]: Without dead ends: 1519 [2025-02-08 07:52:20,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:52:20,552 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 1570 mSDsluCounter, 6832 mSDsCounter, 0 mSdLazyCounter, 5171 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 7823 SdHoareTripleChecker+Invalid, 5197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:20,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 7823 Invalid, 5197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5171 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-08 07:52:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-02-08 07:52:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1515. [2025-02-08 07:52:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1038 states have (on average 1.676300578034682) internal successors, (1740), 1503 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1760 transitions. [2025-02-08 07:52:20,565 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1760 transitions. Word has length 87 [2025-02-08 07:52:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:20,565 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1760 transitions. [2025-02-08 07:52:20,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 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:52:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1760 transitions. [2025-02-08 07:52:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 07:52:20,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:20,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:52:20,566 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:20,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 920825195, now seen corresponding path program 1 times [2025-02-08 07:52:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402874721] [2025-02-08 07:52:20,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:20,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:20,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 07:52:20,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 07:52:20,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:20,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:20,995 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:52:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402874721] [2025-02-08 07:52:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402874721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:20,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:20,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:52:20,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930508487] [2025-02-08 07:52:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:52:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:20,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:52:20,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:52:20,997 INFO L87 Difference]: Start difference. First operand 1515 states and 1760 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 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:52:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:23,187 INFO L93 Difference]: Finished difference Result 1518 states and 1767 transitions. [2025-02-08 07:52:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 07:52:23,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 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 87 [2025-02-08 07:52:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:23,190 INFO L225 Difference]: With dead ends: 1518 [2025-02-08 07:52:23,190 INFO L226 Difference]: Without dead ends: 1518 [2025-02-08 07:52:23,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:52:23,190 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1548 mSDsluCounter, 5159 mSDsCounter, 0 mSdLazyCounter, 5167 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 6157 SdHoareTripleChecker+Invalid, 5191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:23,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 6157 Invalid, 5191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5167 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 07:52:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2025-02-08 07:52:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1515. [2025-02-08 07:52:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1038 states have (on average 1.6753371868978806) internal successors, (1739), 1503 states have internal predecessors, (1739), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1759 transitions. [2025-02-08 07:52:23,218 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1759 transitions. Word has length 87 [2025-02-08 07:52:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:23,218 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1759 transitions. [2025-02-08 07:52:23,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 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:52:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1759 transitions. [2025-02-08 07:52:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 07:52:23,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:23,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:52:23,219 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:23,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1817629959, now seen corresponding path program 1 times [2025-02-08 07:52:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:23,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143595629] [2025-02-08 07:52:23,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:23,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:52:23,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:52:23,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:23,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:23,606 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:52:23,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:23,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143595629] [2025-02-08 07:52:23,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143595629] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:23,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442199999] [2025-02-08 07:52:23,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:23,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:23,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:52:23,612 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:52:23,614 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:52:23,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:52:23,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:52:23,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:23,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:23,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 07:52:23,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:52:23,795 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 6 treesize of output 5 [2025-02-08 07:52:23,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:52:23,869 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 11 treesize of output 11 [2025-02-08 07:52:23,873 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 19 treesize of output 1 [2025-02-08 07:52:23,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:23,912 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 42 treesize of output 41 [2025-02-08 07:52:23,947 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:23,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:52:23,958 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 31 treesize of output 13 [2025-02-08 07:52:23,960 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:52:23,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:52:24,042 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-08 07:52:24,042 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 33 treesize of output 32 [2025-02-08 07:52:24,046 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_928))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_925)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-08 07:52:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442199999] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:24,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:52:24,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2025-02-08 07:52:24,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926581575] [2025-02-08 07:52:24,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:52:24,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:52:24,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:24,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:52:24,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=245, Unknown=14, NotChecked=32, Total=342 [2025-02-08 07:52:24,048 INFO L87 Difference]: Start difference. First operand 1515 states and 1759 transitions. Second operand has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 1 states have call successors, (1), 1 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:52:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:26,887 INFO L93 Difference]: Finished difference Result 1517 states and 1766 transitions. [2025-02-08 07:52:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:52:26,888 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 1 states have call successors, (1), 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 88 [2025-02-08 07:52:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:26,890 INFO L225 Difference]: With dead ends: 1517 [2025-02-08 07:52:26,890 INFO L226 Difference]: Without dead ends: 1517 [2025-02-08 07:52:26,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=484, Unknown=14, NotChecked=46, Total=650 [2025-02-08 07:52:26,891 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 1538 mSDsluCounter, 9731 mSDsCounter, 0 mSdLazyCounter, 7099 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 10722 SdHoareTripleChecker+Invalid, 7124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:26,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 10722 Invalid, 7124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7099 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-08 07:52:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-02-08 07:52:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1514. [2025-02-08 07:52:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1038 states have (on average 1.674373795761079) internal successors, (1738), 1502 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1758 transitions. [2025-02-08 07:52:26,901 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1758 transitions. Word has length 88 [2025-02-08 07:52:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:26,901 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1758 transitions. [2025-02-08 07:52:26,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 1 states have call successors, (1), 1 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:52:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1758 transitions. [2025-02-08 07:52:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 07:52:26,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:26,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:26,909 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:52:27,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:27,106 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:27,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1817629958, now seen corresponding path program 1 times [2025-02-08 07:52:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:27,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016233380] [2025-02-08 07:52:27,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:27,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:27,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:52:27,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:52:27,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:27,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:27,531 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:52:27,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:27,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016233380] [2025-02-08 07:52:27,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016233380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:27,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512220142] [2025-02-08 07:52:27,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:27,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:27,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:52:27,533 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:52:27,535 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:52:27,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:52:27,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:52:27,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:27,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:27,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 07:52:27,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:52:27,721 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 6 treesize of output 5 [2025-02-08 07:52:27,787 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:52:27,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:52:27,794 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 11 treesize of output 11 [2025-02-08 07:52:27,813 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:52:27,817 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 19 treesize of output 1 [2025-02-08 07:52:27,872 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 22 treesize of output 10 [2025-02-08 07:52:27,875 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 9 treesize of output 3 [2025-02-08 07:52:27,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:27,940 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 62 treesize of output 57 [2025-02-08 07:52:27,942 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 30 treesize of output 13 [2025-02-08 07:52:27,996 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:27,996 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 62 treesize of output 57 [2025-02-08 07:52:27,999 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 30 treesize of output 13 [2025-02-08 07:52:28,010 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 31 treesize of output 13 [2025-02-08 07:52:28,012 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 9 treesize of output 3 [2025-02-08 07:52:28,026 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:52:28,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:52:28,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-02-08 07:52:28,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-02-08 07:52:28,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int)) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1075))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:52:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512220142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:28,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:52:28,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-08 07:52:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115253499] [2025-02-08 07:52:28,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:52:28,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 07:52:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:28,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 07:52:28,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2025-02-08 07:52:28,112 INFO L87 Difference]: Start difference. First operand 1514 states and 1758 transitions. Second operand has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:52:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:31,460 INFO L93 Difference]: Finished difference Result 1516 states and 1765 transitions. [2025-02-08 07:52:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:52:31,460 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2025-02-08 07:52:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:31,462 INFO L225 Difference]: With dead ends: 1516 [2025-02-08 07:52:31,462 INFO L226 Difference]: Without dead ends: 1516 [2025-02-08 07:52:31,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2025-02-08 07:52:31,463 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1541 mSDsluCounter, 7450 mSDsCounter, 0 mSdLazyCounter, 7776 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 8446 SdHoareTripleChecker+Invalid, 7804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:31,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 8446 Invalid, 7804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 7776 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 07:52:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2025-02-08 07:52:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1504. [2025-02-08 07:52:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1030 states have (on average 1.6776699029126214) internal successors, (1728), 1493 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1747 transitions. [2025-02-08 07:52:31,473 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1747 transitions. Word has length 88 [2025-02-08 07:52:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:31,473 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1747 transitions. [2025-02-08 07:52:31,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:52:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1747 transitions. [2025-02-08 07:52:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 07:52:31,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:31,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:31,481 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:52:31,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:31,679 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:31,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 348945742, now seen corresponding path program 1 times [2025-02-08 07:52:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:31,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894177567] [2025-02-08 07:52:31,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:31,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 07:52:31,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 07:52:31,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:31,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:32,146 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:52:32,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:32,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894177567] [2025-02-08 07:52:32,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894177567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:32,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:32,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 07:52:32,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988210981] [2025-02-08 07:52:32,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:32,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:52:32,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:32,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:52:32,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:52:32,147 INFO L87 Difference]: Start difference. First operand 1504 states and 1747 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:52:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:34,957 INFO L93 Difference]: Finished difference Result 1520 states and 1769 transitions. [2025-02-08 07:52:34,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:52:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-02-08 07:52:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:34,960 INFO L225 Difference]: With dead ends: 1520 [2025-02-08 07:52:34,960 INFO L226 Difference]: Without dead ends: 1520 [2025-02-08 07:52:34,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-02-08 07:52:34,961 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 1573 mSDsluCounter, 9729 mSDsCounter, 0 mSdLazyCounter, 7095 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 10719 SdHoareTripleChecker+Invalid, 7121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:34,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 10719 Invalid, 7121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7095 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-08 07:52:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-02-08 07:52:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1516. [2025-02-08 07:52:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1041 states have (on average 1.6724303554274735) internal successors, (1741), 1504 states have internal predecessors, (1741), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1761 transitions. [2025-02-08 07:52:34,974 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1761 transitions. Word has length 90 [2025-02-08 07:52:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:34,974 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1761 transitions. [2025-02-08 07:52:34,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:52:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1761 transitions. [2025-02-08 07:52:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 07:52:34,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:34,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:34,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 07:52:34,975 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:34,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:34,975 INFO L85 PathProgramCache]: Analyzing trace with hash 348945743, now seen corresponding path program 1 times [2025-02-08 07:52:34,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:34,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809695216] [2025-02-08 07:52:34,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:34,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 07:52:35,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 07:52:35,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:35,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:35,424 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:52:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809695216] [2025-02-08 07:52:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809695216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:35,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:35,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 07:52:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506581561] [2025-02-08 07:52:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:35,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 07:52:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:35,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 07:52:35,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:52:35,426 INFO L87 Difference]: Start difference. First operand 1516 states and 1761 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:52:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:38,239 INFO L93 Difference]: Finished difference Result 1519 states and 1768 transitions. [2025-02-08 07:52:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:52:38,240 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-02-08 07:52:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:38,245 INFO L225 Difference]: With dead ends: 1519 [2025-02-08 07:52:38,245 INFO L226 Difference]: Without dead ends: 1519 [2025-02-08 07:52:38,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:52:38,246 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1548 mSDsluCounter, 5718 mSDsCounter, 0 mSdLazyCounter, 6244 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 6715 SdHoareTripleChecker+Invalid, 6268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:38,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 6715 Invalid, 6268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6244 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-08 07:52:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-02-08 07:52:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1516. [2025-02-08 07:52:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1041 states have (on average 1.6714697406340058) internal successors, (1740), 1504 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1760 transitions. [2025-02-08 07:52:38,258 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1760 transitions. Word has length 90 [2025-02-08 07:52:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:38,258 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1760 transitions. [2025-02-08 07:52:38,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:52:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1760 transitions. [2025-02-08 07:52:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 07:52:38,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:38,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:38,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 07:52:38,259 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:38,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1935270239, now seen corresponding path program 1 times [2025-02-08 07:52:38,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:38,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417049520] [2025-02-08 07:52:38,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:38,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:52:38,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:52:38,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:38,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:38,864 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:52:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417049520] [2025-02-08 07:52:38,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417049520] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730940418] [2025-02-08 07:52:38,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:38,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:38,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:52:38,867 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:52:38,870 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:52:39,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:52:39,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:52:39,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:39,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:39,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 07:52:39,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:52:39,085 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 6 treesize of output 5 [2025-02-08 07:52:39,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:52:39,201 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 11 treesize of output 11 [2025-02-08 07:52:39,206 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 19 treesize of output 1 [2025-02-08 07:52:39,304 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:39,304 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 42 treesize of output 41 [2025-02-08 07:52:39,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:39,364 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 42 treesize of output 41 [2025-02-08 07:52:39,420 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:39,420 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 42 treesize of output 41 [2025-02-08 07:52:39,432 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 31 treesize of output 13 [2025-02-08 07:52:39,435 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:52:39,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:52:39,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1358) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 07:52:39,501 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1357))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1358)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:52:39,509 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1357))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1358)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:52:39,549 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-02-08 07:52:39,553 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 57 treesize of output 56 [2025-02-08 07:52:39,558 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1361))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1357)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1358)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-08 07:52:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730940418] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:39,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:52:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-02-08 07:52:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23606101] [2025-02-08 07:52:39,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:52:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 07:52:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:39,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 07:52:39,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=319, Unknown=9, NotChecked=156, Total=552 [2025-02-08 07:52:39,563 INFO L87 Difference]: Start difference. First operand 1516 states and 1760 transitions. Second operand has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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:52:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:42,499 INFO L93 Difference]: Finished difference Result 1518 states and 1767 transitions. [2025-02-08 07:52:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:52:42,500 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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 91 [2025-02-08 07:52:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:42,502 INFO L225 Difference]: With dead ends: 1518 [2025-02-08 07:52:42,502 INFO L226 Difference]: Without dead ends: 1518 [2025-02-08 07:52:42,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=630, Unknown=9, NotChecked=220, Total=992 [2025-02-08 07:52:42,503 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 1536 mSDsluCounter, 10694 mSDsCounter, 0 mSdLazyCounter, 7696 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 11684 SdHoareTripleChecker+Invalid, 7721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:42,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 11684 Invalid, 7721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7696 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-08 07:52:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2025-02-08 07:52:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1515. [2025-02-08 07:52:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1041 states have (on average 1.670509125840538) internal successors, (1739), 1503 states have internal predecessors, (1739), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1759 transitions. [2025-02-08 07:52:42,513 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1759 transitions. Word has length 91 [2025-02-08 07:52:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:42,513 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1759 transitions. [2025-02-08 07:52:42,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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:52:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1759 transitions. [2025-02-08 07:52:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 07:52:42,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:42,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:42,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 07:52:42,714 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:52:42,714 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:42,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1935270240, now seen corresponding path program 1 times [2025-02-08 07:52:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:42,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275568276] [2025-02-08 07:52:42,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:42,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:42,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:52:42,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:52:42,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:42,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:43,374 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:52:43,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275568276] [2025-02-08 07:52:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275568276] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426818438] [2025-02-08 07:52:43,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:43,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:43,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:52:43,377 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:52:43,378 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:52:43,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:52:43,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:52:43,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:43,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:43,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 07:52:43,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:52:43,578 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 6 treesize of output 5 [2025-02-08 07:52:43,637 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:52:43,638 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 11 treesize of output 11 [2025-02-08 07:52:43,642 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:52:43,658 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 19 treesize of output 1 [2025-02-08 07:52:43,660 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:52:43,719 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 22 treesize of output 10 [2025-02-08 07:52:43,721 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 9 treesize of output 3 [2025-02-08 07:52:43,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:43,812 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 62 treesize of output 57 [2025-02-08 07:52:43,816 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 30 treesize of output 13 [2025-02-08 07:52:43,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:43,863 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 62 treesize of output 57 [2025-02-08 07:52:43,867 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 30 treesize of output 13 [2025-02-08 07:52:43,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:43,909 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 62 treesize of output 57 [2025-02-08 07:52:43,914 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 30 treesize of output 13 [2025-02-08 07:52:43,929 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 31 treesize of output 13 [2025-02-08 07:52:43,933 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 9 treesize of output 3 [2025-02-08 07:52:43,948 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:52:43,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:52:43,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:52:43,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:52:44,017 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1514))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515) .cse1 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:52:44,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1515) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1514))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1515) .cse2 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-08 07:52:44,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1522))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1514))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523) .cse0 v_ArrVal_1515) .cse1 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1522))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523) .cse5 v_ArrVal_1515) (select (select (store .cse6 .cse5 v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1517))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-02-08 07:52:44,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426818438] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:44,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:52:44,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-02-08 07:52:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080349970] [2025-02-08 07:52:44,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:52:44,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 07:52:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:44,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 07:52:44,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2025-02-08 07:52:44,073 INFO L87 Difference]: Start difference. First operand 1515 states and 1759 transitions. Second operand has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:52:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:47,529 INFO L93 Difference]: Finished difference Result 1517 states and 1766 transitions. [2025-02-08 07:52:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:52:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-02-08 07:52:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:47,531 INFO L225 Difference]: With dead ends: 1517 [2025-02-08 07:52:47,532 INFO L226 Difference]: Without dead ends: 1517 [2025-02-08 07:52:47,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2025-02-08 07:52:47,532 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 1543 mSDsluCounter, 7410 mSDsCounter, 0 mSdLazyCounter, 7766 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 8405 SdHoareTripleChecker+Invalid, 7807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 7766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:47,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 8405 Invalid, 7807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 7766 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-08 07:52:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-02-08 07:52:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1502. [2025-02-08 07:52:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1030 states have (on average 1.6757281553398058) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:52:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1745 transitions. [2025-02-08 07:52:47,541 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1745 transitions. Word has length 91 [2025-02-08 07:52:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:47,541 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1745 transitions. [2025-02-08 07:52:47,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:52:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1745 transitions. [2025-02-08 07:52:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:52:47,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:47,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:47,553 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:52:47,742 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:52:47,742 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:47,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1623447491, now seen corresponding path program 1 times [2025-02-08 07:52:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:47,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921995921] [2025-02-08 07:52:47,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:47,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:52:47,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:52:47,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:47,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:48,110 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:52:48,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921995921] [2025-02-08 07:52:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921995921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 07:52:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90702375] [2025-02-08 07:52:48,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:48,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:52:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:48,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:52:48,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:52:48,112 INFO L87 Difference]: Start difference. First operand 1502 states and 1745 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 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:52:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:50,110 INFO L93 Difference]: Finished difference Result 1521 states and 1770 transitions. [2025-02-08 07:52:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:52:50,111 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 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 93 [2025-02-08 07:52:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:50,118 INFO L225 Difference]: With dead ends: 1521 [2025-02-08 07:52:50,118 INFO L226 Difference]: Without dead ends: 1521 [2025-02-08 07:52:50,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:52:50,118 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 1557 mSDsluCounter, 6816 mSDsCounter, 0 mSdLazyCounter, 5180 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 7805 SdHoareTripleChecker+Invalid, 5206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:50,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 7805 Invalid, 5206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5180 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 07:52:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-02-08 07:52:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1517. [2025-02-08 07:52:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1044 states have (on average 1.6685823754789273) internal successors, (1742), 1505 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1762 transitions. [2025-02-08 07:52:50,141 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1762 transitions. Word has length 93 [2025-02-08 07:52:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:50,141 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1762 transitions. [2025-02-08 07:52:50,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 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:52:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1762 transitions. [2025-02-08 07:52:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:52:50,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:50,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:50,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 07:52:50,142 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:50,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1623447492, now seen corresponding path program 1 times [2025-02-08 07:52:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:50,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223778581] [2025-02-08 07:52:50,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:50,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:52:50,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:52:50,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:50,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:50,813 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:52:50,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:50,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223778581] [2025-02-08 07:52:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223778581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:52:50,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:52:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 07:52:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929115891] [2025-02-08 07:52:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:52:50,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:52:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:50,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:52:50,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:52:50,815 INFO L87 Difference]: Start difference. First operand 1517 states and 1762 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 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:52:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:53,542 INFO L93 Difference]: Finished difference Result 1520 states and 1769 transitions. [2025-02-08 07:52:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:52:53,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 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 93 [2025-02-08 07:52:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:53,545 INFO L225 Difference]: With dead ends: 1520 [2025-02-08 07:52:53,545 INFO L226 Difference]: Without dead ends: 1520 [2025-02-08 07:52:53,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-02-08 07:52:53,546 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1550 mSDsluCounter, 7412 mSDsCounter, 0 mSdLazyCounter, 7738 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 8408 SdHoareTripleChecker+Invalid, 7762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:53,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 8408 Invalid, 7762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7738 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-08 07:52:53,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-02-08 07:52:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1517. [2025-02-08 07:52:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1044 states have (on average 1.667624521072797) internal successors, (1741), 1505 states have internal predecessors, (1741), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1761 transitions. [2025-02-08 07:52:53,562 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1761 transitions. Word has length 93 [2025-02-08 07:52:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:53,562 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1761 transitions. [2025-02-08 07:52:53,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 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:52:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1761 transitions. [2025-02-08 07:52:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:52:53,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:53,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:53,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 07:52:53,563 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2003587566, now seen corresponding path program 1 times [2025-02-08 07:52:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787609172] [2025-02-08 07:52:53,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:53,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:52:53,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:52:53,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:53,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:53,972 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:52:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787609172] [2025-02-08 07:52:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787609172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297338840] [2025-02-08 07:52:53,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:53,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:53,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:52:53,974 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:52:53,975 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:52:54,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:52:54,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:52:54,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:54,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:54,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 07:52:54,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:52:54,187 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 6 treesize of output 5 [2025-02-08 07:52:54,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:52:54,240 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 11 treesize of output 11 [2025-02-08 07:52:54,244 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 19 treesize of output 1 [2025-02-08 07:52:54,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:54,302 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 42 treesize of output 41 [2025-02-08 07:52:54,337 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:54,337 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 42 treesize of output 41 [2025-02-08 07:52:54,369 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:54,370 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 42 treesize of output 41 [2025-02-08 07:52:54,402 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:54,402 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 42 treesize of output 41 [2025-02-08 07:52:54,409 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 31 treesize of output 13 [2025-02-08 07:52:54,411 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:52:54,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:52:54,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 07:52:54,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-08 07:52:54,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1829))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:52:54,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1828 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1828))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1829)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:52:54,510 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-02-08 07:52:54,510 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 105 treesize of output 104 [2025-02-08 07:52:54,514 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1828 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1833))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1828)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1829)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-08 07:52:54,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297338840] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:54,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:52:54,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-02-08 07:52:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929568839] [2025-02-08 07:52:54,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:52:54,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:52:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:52:54,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:52:54,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=420, Unknown=16, NotChecked=230, Total=756 [2025-02-08 07:52:54,517 INFO L87 Difference]: Start difference. First operand 1517 states and 1761 transitions. Second operand has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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:52:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:52:58,271 INFO L93 Difference]: Finished difference Result 1519 states and 1768 transitions. [2025-02-08 07:52:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:52:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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 94 [2025-02-08 07:52:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:52:58,274 INFO L225 Difference]: With dead ends: 1519 [2025-02-08 07:52:58,274 INFO L226 Difference]: Without dead ends: 1519 [2025-02-08 07:52:58,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=824, Unknown=16, NotChecked=320, Total=1332 [2025-02-08 07:52:58,275 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 1534 mSDsluCounter, 14539 mSDsCounter, 0 mSdLazyCounter, 10278 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 15528 SdHoareTripleChecker+Invalid, 10303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 10278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:52:58,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 15528 Invalid, 10303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 10278 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-08 07:52:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-02-08 07:52:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1516. [2025-02-08 07:52:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1044 states have (on average 1.6666666666666667) internal successors, (1740), 1504 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:52:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1760 transitions. [2025-02-08 07:52:58,285 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1760 transitions. Word has length 94 [2025-02-08 07:52:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:52:58,285 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1760 transitions. [2025-02-08 07:52:58,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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:52:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1760 transitions. [2025-02-08 07:52:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:52:58,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:52:58,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:52:58,297 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:52:58,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:58,486 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:52:58,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:52:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2003587565, now seen corresponding path program 1 times [2025-02-08 07:52:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:52:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447711040] [2025-02-08 07:52:58,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:58,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:52:58,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:52:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:52:58,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:58,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:59,317 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:52:59,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:52:59,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447711040] [2025-02-08 07:52:59,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447711040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:52:59,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491091338] [2025-02-08 07:52:59,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:52:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:52:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:52:59,320 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:52:59,321 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:52:59,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:52:59,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:52:59,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:52:59,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:52:59,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 07:52:59,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:52:59,539 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 6 treesize of output 5 [2025-02-08 07:52:59,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:52:59,598 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 11 treesize of output 11 [2025-02-08 07:52:59,602 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:52:59,605 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 19 treesize of output 1 [2025-02-08 07:52:59,608 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:52:59,655 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 22 treesize of output 10 [2025-02-08 07:52:59,657 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 9 treesize of output 3 [2025-02-08 07:52:59,724 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:59,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:52:59,727 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 30 treesize of output 13 [2025-02-08 07:52:59,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:59,768 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 62 treesize of output 57 [2025-02-08 07:52:59,771 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 30 treesize of output 13 [2025-02-08 07:52:59,804 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:59,804 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 62 treesize of output 57 [2025-02-08 07:52:59,807 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 30 treesize of output 13 [2025-02-08 07:52:59,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:52:59,847 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 62 treesize of output 57 [2025-02-08 07:52:59,849 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 30 treesize of output 13 [2025-02-08 07:52:59,859 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 31 treesize of output 13 [2025-02-08 07:52:59,863 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 9 treesize of output 3 [2025-02-08 07:52:59,867 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:52:59,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:52:59,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2003 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-02-08 07:52:59,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2003 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2025-02-08 07:52:59,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2000) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2001))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2000) .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:52:59,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2000) .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2000) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2025-02-08 07:52:59,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1998))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1999) .cse0 v_ArrVal_2000) .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1998))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1999) .cse5 v_ArrVal_2000) (select (select (store .cse6 .cse5 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2003))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-02-08 07:53:00,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2008 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2008))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1998))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2001))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2009) .cse0 v_ArrVal_1999) .cse1 v_ArrVal_2000) .cse2 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2008 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2008))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1998))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2009) .cse7 v_ArrVal_1999) .cse8 v_ArrVal_2000) (select (select (store .cse9 .cse8 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2003))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-02-08 07:53:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491091338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:53:00,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:53:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-02-08 07:53:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553718239] [2025-02-08 07:53:00,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:53:00,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 07:53:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:53:00,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 07:53:00,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=424, Unknown=10, NotChecked=282, Total=812 [2025-02-08 07:53:00,403 INFO L87 Difference]: Start difference. First operand 1516 states and 1760 transitions. Second operand has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:53:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:53:03,600 INFO L93 Difference]: Finished difference Result 1518 states and 1767 transitions. [2025-02-08 07:53:03,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:53:03,601 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-02-08 07:53:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:53:03,607 INFO L225 Difference]: With dead ends: 1518 [2025-02-08 07:53:03,607 INFO L226 Difference]: Without dead ends: 1518 [2025-02-08 07:53:03,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=728, Unknown=10, NotChecked=366, Total=1260 [2025-02-08 07:53:03,607 INFO L435 NwaCegarLoop]: 994 mSDtfsCounter, 1537 mSDsluCounter, 6675 mSDsCounter, 0 mSdLazyCounter, 6931 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 7669 SdHoareTripleChecker+Invalid, 6970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 6931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:53:03,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 7669 Invalid, 6970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 6931 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-08 07:53:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2025-02-08 07:53:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1500. [2025-02-08 07:53:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1030 states have (on average 1.6737864077669904) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:53:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1743 transitions. [2025-02-08 07:53:03,633 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1743 transitions. Word has length 94 [2025-02-08 07:53:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:53:03,634 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1743 transitions. [2025-02-08 07:53:03,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:53:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1743 transitions. [2025-02-08 07:53:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:53:03,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:53:03,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:53:03,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 07:53:03,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 07:53:03,837 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:53:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:53:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 719254973, now seen corresponding path program 1 times [2025-02-08 07:53:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:53:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753098637] [2025-02-08 07:53:03,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:53:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:53:03,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:53:03,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:53:03,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:53:03,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:53:04,316 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:53:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:53:04,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753098637] [2025-02-08 07:53:04,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753098637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:53:04,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:53:04,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 07:53:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823122003] [2025-02-08 07:53:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:53:04,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 07:53:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:53:04,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 07:53:04,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:53:04,318 INFO L87 Difference]: Start difference. First operand 1500 states and 1743 transitions. Second operand has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 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:53:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:53:07,589 INFO L93 Difference]: Finished difference Result 1523 states and 1772 transitions. [2025-02-08 07:53:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:53:07,590 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 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) Word has length 97 [2025-02-08 07:53:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:53:07,592 INFO L225 Difference]: With dead ends: 1523 [2025-02-08 07:53:07,592 INFO L226 Difference]: Without dead ends: 1523 [2025-02-08 07:53:07,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-02-08 07:53:07,592 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 1569 mSDsluCounter, 10663 mSDsCounter, 0 mSdLazyCounter, 7727 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 11651 SdHoareTripleChecker+Invalid, 7754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:53:07,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 11651 Invalid, 7754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7727 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-08 07:53:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-02-08 07:53:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1519. [2025-02-08 07:53:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1048 states have (on average 1.6641221374045803) internal successors, (1744), 1507 states have internal predecessors, (1744), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:53:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1764 transitions. [2025-02-08 07:53:07,603 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1764 transitions. Word has length 97 [2025-02-08 07:53:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:53:07,603 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1764 transitions. [2025-02-08 07:53:07,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 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:53:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1764 transitions. [2025-02-08 07:53:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:53:07,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:53:07,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:53:07,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 07:53:07,604 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:53:07,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:53:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 719254974, now seen corresponding path program 1 times [2025-02-08 07:53:07,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:53:07,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783529325] [2025-02-08 07:53:07,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:53:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:53:07,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:53:07,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:53:07,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:53:07,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:53:08,331 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:53:08,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:53:08,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783529325] [2025-02-08 07:53:08,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783529325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:53:08,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:53:08,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 07:53:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673234072] [2025-02-08 07:53:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:53:08,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:53:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:53:08,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:53:08,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-08 07:53:08,332 INFO L87 Difference]: Start difference. First operand 1519 states and 1764 transitions. Second operand has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 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:53:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:53:11,626 INFO L93 Difference]: Finished difference Result 1522 states and 1771 transitions. [2025-02-08 07:53:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:53:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 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) Word has length 97 [2025-02-08 07:53:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:53:11,630 INFO L225 Difference]: With dead ends: 1522 [2025-02-08 07:53:11,631 INFO L226 Difference]: Without dead ends: 1522 [2025-02-08 07:53:11,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-02-08 07:53:11,631 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 1568 mSDsluCounter, 7182 mSDsCounter, 0 mSdLazyCounter, 8045 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 8171 SdHoareTripleChecker+Invalid, 8074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:53:11,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 8171 Invalid, 8074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 8045 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-08 07:53:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-02-08 07:53:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1519. [2025-02-08 07:53:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1048 states have (on average 1.6631679389312977) internal successors, (1743), 1507 states have internal predecessors, (1743), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:53:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1763 transitions. [2025-02-08 07:53:11,642 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1763 transitions. Word has length 97 [2025-02-08 07:53:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:53:11,643 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1763 transitions. [2025-02-08 07:53:11,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 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:53:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1763 transitions. [2025-02-08 07:53:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:53:11,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:53:11,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:53:11,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 07:53:11,644 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:53:11,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:53:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1624437620, now seen corresponding path program 1 times [2025-02-08 07:53:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:53:11,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420600071] [2025-02-08 07:53:11,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:53:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:53:11,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:53:11,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:53:11,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:53:11,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:53:12,143 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:53:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:53:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420600071] [2025-02-08 07:53:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420600071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:53:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767048652] [2025-02-08 07:53:12,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:53:12,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:53:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:53:12,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:53:12,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 07:53:12,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:53:12,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:53:12,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:53:12,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:53:12,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 07:53:12,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:53:12,385 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 6 treesize of output 5 [2025-02-08 07:53:12,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:53:12,451 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 11 treesize of output 11 [2025-02-08 07:53:12,455 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 19 treesize of output 1 [2025-02-08 07:53:12,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:12,487 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 42 treesize of output 41 [2025-02-08 07:53:12,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:12,505 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 42 treesize of output 41 [2025-02-08 07:53:12,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:12,539 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 42 treesize of output 41 [2025-02-08 07:53:12,573 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:12,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:53:12,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:12,607 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 42 treesize of output 41 [2025-02-08 07:53:12,614 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 31 treesize of output 13 [2025-02-08 07:53:12,627 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:53:12,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 07:53:12,629 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:53:12,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:53:13,176 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-02-08 07:53:13,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2025-02-08 07:53:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767048652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:53:13,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:53:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 20 [2025-02-08 07:53:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105426807] [2025-02-08 07:53:13,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:53:13,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:53:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:53:13,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:53:13,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=803, Unknown=53, NotChecked=0, Total=992 [2025-02-08 07:53:13,255 INFO L87 Difference]: Start difference. First operand 1519 states and 1763 transitions. Second operand has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:53:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:53:16,816 INFO L93 Difference]: Finished difference Result 1521 states and 1770 transitions. [2025-02-08 07:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 07:53:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-08 07:53:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:53:16,819 INFO L225 Difference]: With dead ends: 1521 [2025-02-08 07:53:16,819 INFO L226 Difference]: Without dead ends: 1521 [2025-02-08 07:53:16,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=1412, Unknown=53, NotChecked=0, Total=1722 [2025-02-08 07:53:16,820 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 1533 mSDsluCounter, 11626 mSDsCounter, 0 mSdLazyCounter, 8385 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 12614 SdHoareTripleChecker+Invalid, 8411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:53:16,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 12614 Invalid, 8411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 8385 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-08 07:53:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-02-08 07:53:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1518. [2025-02-08 07:53:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1048 states have (on average 1.6622137404580153) internal successors, (1742), 1506 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:53:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1762 transitions. [2025-02-08 07:53:16,829 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1762 transitions. Word has length 98 [2025-02-08 07:53:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:53:16,829 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1762 transitions. [2025-02-08 07:53:16,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:53:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1762 transitions. [2025-02-08 07:53:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:53:16,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:53:16,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:53:16,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 07:53:17,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:53:17,031 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:53:17,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:53:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1624437619, now seen corresponding path program 1 times [2025-02-08 07:53:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:53:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927825758] [2025-02-08 07:53:17,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:53:17,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:53:17,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:53:17,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:53:17,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:53:17,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:53:17,792 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:53:17,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:53:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927825758] [2025-02-08 07:53:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927825758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:53:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814583116] [2025-02-08 07:53:17,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:53:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:53:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:53:17,795 INFO L229 MonitoredProcess]: Starting monitored process 11 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:53:17,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 07:53:17,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:53:18,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:53:18,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:53:18,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:53:18,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 07:53:18,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:53:18,049 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 6 treesize of output 5 [2025-02-08 07:53:18,178 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 07:53:18,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 07:53:18,193 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:53:18,234 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 19 treesize of output 1 [2025-02-08 07:53:18,245 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:53:18,333 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 33 treesize of output 15 [2025-02-08 07:53:18,336 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 9 treesize of output 3 [2025-02-08 07:53:18,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:18,494 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 73 treesize of output 66 [2025-02-08 07:53:18,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 30 treesize of output 13 [2025-02-08 07:53:18,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:18,585 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 73 treesize of output 66 [2025-02-08 07:53:18,590 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 30 treesize of output 13 [2025-02-08 07:53:18,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:18,651 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 73 treesize of output 66 [2025-02-08 07:53:18,657 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 30 treesize of output 13 [2025-02-08 07:53:18,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:18,723 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 73 treesize of output 66 [2025-02-08 07:53:18,726 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 30 treesize of output 13 [2025-02-08 07:53:18,804 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:53:18,805 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 73 treesize of output 66 [2025-02-08 07:53:18,816 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 30 treesize of output 13 [2025-02-08 07:53:18,841 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 42 treesize of output 18 [2025-02-08 07:53:18,845 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 9 treesize of output 3 [2025-02-08 07:53:18,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:53:18,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 14 treesize of output 9 [2025-02-08 07:53:18,932 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 07:53:18,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 07:53:18,939 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:53:18,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:53:19,773 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2538))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2537) .cse1 v_ArrVal_2540) (select (select (store .cse2 .cse1 v_ArrVal_2539) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2542))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2543 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2538))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2539))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2537) .cse4 v_ArrVal_2540) .cse5 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse6 .cse5 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-02-08 07:53:20,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2535))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2538))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2536) .cse1 v_ArrVal_2537) .cse2 v_ArrVal_2540) (select (select (store .cse3 .cse2 v_ArrVal_2539) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2542))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2543 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2535))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2538))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2539))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2536) .cse6 v_ArrVal_2537) .cse7 v_ArrVal_2540) .cse8 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse9 .cse8 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2025-02-08 07:53:20,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2548))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2535))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2538))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2549) .cse0 v_ArrVal_2536) .cse1 v_ArrVal_2537) .cse2 v_ArrVal_2540) (select (select (store .cse3 .cse2 v_ArrVal_2539) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2542))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2543 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2548))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2535))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2538))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2539))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2549) .cse7 v_ArrVal_2536) .cse8 v_ArrVal_2537) .cse9 v_ArrVal_2540) .cse10 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse11 .cse10 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2025-02-08 07:53:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814583116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:53:20,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:53:20,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2025-02-08 07:53:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773908138] [2025-02-08 07:53:20,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:53:20,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 07:53:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:53:20,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 07:53:20,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1203, Unknown=33, NotChecked=222, Total=1640 [2025-02-08 07:53:20,244 INFO L87 Difference]: Start difference. First operand 1518 states and 1762 transitions. Second operand has 29 states, 26 states have (on average 6.076923076923077) internal successors, (158), 28 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:53:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:53:26,447 INFO L93 Difference]: Finished difference Result 1520 states and 1769 transitions. [2025-02-08 07:53:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 07:53:26,447 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.076923076923077) internal successors, (158), 28 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2025-02-08 07:53:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:53:26,452 INFO L225 Difference]: With dead ends: 1520 [2025-02-08 07:53:26,453 INFO L226 Difference]: Without dead ends: 1520 [2025-02-08 07:53:26,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=209, Invalid=1410, Unknown=33, NotChecked=240, Total=1892 [2025-02-08 07:53:26,455 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 1514 mSDsluCounter, 11524 mSDsCounter, 0 mSdLazyCounter, 11700 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 12511 SdHoareTripleChecker+Invalid, 11727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 11700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:53:26,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 12511 Invalid, 11727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 11700 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-08 07:53:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-02-08 07:53:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1498. [2025-02-08 07:53:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1030 states have (on average 1.6718446601941748) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:53:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1741 transitions. [2025-02-08 07:53:26,479 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1741 transitions. Word has length 98 [2025-02-08 07:53:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:53:26,479 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1741 transitions. [2025-02-08 07:53:26,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.076923076923077) internal successors, (158), 28 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:53:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1741 transitions. [2025-02-08 07:53:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 07:53:26,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:53:26,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:53:26,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 07:53:26,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:53:26,682 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr593REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-08 07:53:26,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:53:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash -265250107, now seen corresponding path program 1 times [2025-02-08 07:53:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:53:26,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635680363] [2025-02-08 07:53:26,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:53:26,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:53:26,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 07:53:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 07:53:26,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:53:26,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:53:27,164 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:53:27,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:53:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635680363] [2025-02-08 07:53:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635680363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:53:27,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:53:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 07:53:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196294301] [2025-02-08 07:53:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:53:27,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:53:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:53:27,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:53:27,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:53:27,173 INFO L87 Difference]: Start difference. First operand 1498 states and 1741 transitions. Second operand has 15 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)