./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.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/list-simple/dll2n_update_all_reverse.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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:42:14,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:42:14,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:42:14,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:42:14,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:42:14,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:42:14,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:42:14,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:42:14,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:42:14,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:42:14,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:42:14,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:42:14,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:42:14,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:42:14,203 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:42:14,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:42:14,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:42:14,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:42:14,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:42:14,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:42:14,203 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:42:14,203 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:42:14,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:42:14,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:42:14,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:42:14,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:42:14,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:42:14,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:42:14,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:42:14,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:42:14,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:42:14,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:42:14,206 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2025-02-08 06:42:14,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:42:14,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:42:14,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:42:14,446 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:42:14,446 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:42:14,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2025-02-08 06:42:15,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37119bdf0/85c635b63b78415380e1ea531ccf17c5/FLAG95f6c989a [2025-02-08 06:42:15,876 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:42:15,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2025-02-08 06:42:15,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37119bdf0/85c635b63b78415380e1ea531ccf17c5/FLAG95f6c989a [2025-02-08 06:42:16,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37119bdf0/85c635b63b78415380e1ea531ccf17c5 [2025-02-08 06:42:16,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:42:16,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:42:16,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:42:16,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:42:16,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:42:16,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae41c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16, skipping insertion in model container [2025-02-08 06:42:16,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:42:16,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:42:16,474 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:42:16,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:42:16,529 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:42:16,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16 WrapperNode [2025-02-08 06:42:16,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:42:16,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:42:16,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:42:16,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:42:16,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,562 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2025-02-08 06:42:16,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:42:16,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:42:16,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:42:16,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:42:16,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,588 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-02-08 06:42:16,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:42:16,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:42:16,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:42:16,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:42:16,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (1/1) ... [2025-02-08 06:42:16,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:42:16,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:16,625 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 06:42:16,628 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 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-08 06:42:16,643 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:42:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:42:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:42:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:42:16,715 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:42:16,716 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:42:16,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-08 06:42:16,878 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: assume main_~expected~0#1 != main_#t~ret14#1;havoc main_#t~ret14#1; [2025-02-08 06:42:16,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: assume !(main_~expected~0#1 != main_#t~ret14#1);havoc main_#t~ret14#1;havoc main_~expected~0#1;main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; [2025-02-08 06:42:16,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:42:16,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:42:16,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:42:16,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:42:16,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc dll_get_data_at_#t~mem9#1;main_#t~ret14#1 := dll_get_data_at_#res#1;havoc dll_get_data_at_#t~mem7#1.base, dll_get_data_at_#t~mem7#1.offset, dll_get_data_at_#t~post8#1, dll_get_data_at_#t~mem9#1, dll_get_data_at_~head#1.base, dll_get_data_at_~head#1.offset, dll_get_data_at_~index#1;havoc dll_get_data_at_#in~head#1.base, dll_get_data_at_#in~head#1.offset, dll_get_data_at_#in~index#1;assume { :end_inline_dll_get_data_at } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; [2025-02-08 06:42:16,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1; [2025-02-08 06:42:16,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L641-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:42:16,900 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-08 06:42:16,901 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:42:16,910 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:42:16,912 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:42:16,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:42:16 BoogieIcfgContainer [2025-02-08 06:42:16,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:42:16,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:42:16,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:42:16,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:42:16,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:42:16" (1/3) ... [2025-02-08 06:42:16,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789311c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:42:16, skipping insertion in model container [2025-02-08 06:42:16,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:16" (2/3) ... [2025-02-08 06:42:16,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789311c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:42:16, skipping insertion in model container [2025-02-08 06:42:16,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:42:16" (3/3) ... [2025-02-08 06:42:16,922 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2025-02-08 06:42:16,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:42:16,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_update_all_reverse.i that has 2 procedures, 57 locations, 1 initial locations, 6 loop locations, and 23 error locations. [2025-02-08 06:42:16,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:42:16,977 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;@4619fc73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:42:16,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 06:42:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 31 states have (on average 1.967741935483871) internal successors, (61), 54 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:42:16,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:16,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:42:16,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:16,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash 3292860, now seen corresponding path program 1 times [2025-02-08 06:42:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221707522] [2025-02-08 06:42:16,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:16,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:17,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:42:17,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:42:17,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:17,158 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 06:42:17,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221707522] [2025-02-08 06:42:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221707522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:42:17,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442735196] [2025-02-08 06:42:17,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:17,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:17,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:17,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:17,181 INFO L87 Difference]: Start difference. First operand has 56 states, 31 states have (on average 1.967741935483871) internal successors, (61), 54 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 06:42:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:17,227 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-02-08 06:42:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:17,229 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 06:42:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:17,232 INFO L225 Difference]: With dead ends: 53 [2025-02-08 06:42:17,232 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:42:17,233 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 06:42:17,235 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:17,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:42:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 06:42:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 45 states have internal predecessors, (51), 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 06:42:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-02-08 06:42:17,279 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 4 [2025-02-08 06:42:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:17,279 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-02-08 06:42:17,279 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 06:42:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-02-08 06:42:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:42:17,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:17,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:42:17,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:42:17,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:17,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash 3292861, now seen corresponding path program 1 times [2025-02-08 06:42:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:17,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752690769] [2025-02-08 06:42:17,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:17,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:17,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:42:17,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:42:17,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:17,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752690769] [2025-02-08 06:42:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752690769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:17,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:17,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:42:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836077874] [2025-02-08 06:42:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:17,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:17,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:17,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:17,393 INFO L87 Difference]: Start difference. First operand 46 states and 51 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 06:42:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:17,435 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-02-08 06:42:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:17,435 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 06:42:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:17,435 INFO L225 Difference]: With dead ends: 43 [2025-02-08 06:42:17,435 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 06:42:17,436 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 06:42:17,436 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:17,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 67 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 06:42:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 06:42:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 42 states have internal predecessors, (48), 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 06:42:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-02-08 06:42:17,441 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 4 [2025-02-08 06:42:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:17,441 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-02-08 06:42:17,441 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 06:42:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-02-08 06:42:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:42:17,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:17,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:42:17,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:42:17,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:17,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash 101493897, now seen corresponding path program 1 times [2025-02-08 06:42:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:17,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680679854] [2025-02-08 06:42:17,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:17,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:42:17,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:42:17,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:17,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:17,505 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 06:42:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:17,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680679854] [2025-02-08 06:42:17,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680679854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:17,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:17,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:42:17,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789727529] [2025-02-08 06:42:17,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:17,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:17,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:17,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:17,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:17,508 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:17,517 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-02-08 06:42:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:17,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:42:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:17,519 INFO L225 Difference]: With dead ends: 53 [2025-02-08 06:42:17,519 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 06:42:17,519 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 06:42:17,519 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:17,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 06:42:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2025-02-08 06:42:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.75) internal successors, (49), 43 states have internal predecessors, (49), 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 06:42:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-02-08 06:42:17,526 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 5 [2025-02-08 06:42:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:17,527 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-02-08 06:42:17,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-02-08 06:42:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:42:17,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:17,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:42:17,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 189650454, now seen corresponding path program 1 times [2025-02-08 06:42:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:17,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524607323] [2025-02-08 06:42:17,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:42:17,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:42:17,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:17,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:17,604 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 06:42:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524607323] [2025-02-08 06:42:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524607323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:42:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147886905] [2025-02-08 06:42:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:17,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:17,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:17,608 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:17,627 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-02-08 06:42:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:17,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:42:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:17,628 INFO L225 Difference]: With dead ends: 49 [2025-02-08 06:42:17,628 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:42:17,629 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 06:42:17,629 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:17,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:42:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:42:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 48 states have internal predecessors, (54), 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 06:42:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-02-08 06:42:17,636 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 8 [2025-02-08 06:42:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:17,637 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-02-08 06:42:17,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-02-08 06:42:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:42:17,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:17,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:17,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:42:17,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:17,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1734100688, now seen corresponding path program 1 times [2025-02-08 06:42:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:17,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820966190] [2025-02-08 06:42:17,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:17,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:42:17,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:42:17,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:17,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:17,737 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 06:42:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820966190] [2025-02-08 06:42:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820966190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288037649] [2025-02-08 06:42:17,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:17,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:17,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:17,740 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 06:42:17,742 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 06:42:17,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:42:17,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:42:17,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:17,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:17,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:42:17,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:17,848 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 06:42:17,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:17,873 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 06:42:17,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288037649] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:17,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:17,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-08 06:42:17,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706219649] [2025-02-08 06:42:17,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:17,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:42:17,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:17,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:42:17,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:17,876 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 06:42:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:17,898 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-02-08 06:42:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:42:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 12 [2025-02-08 06:42:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:17,899 INFO L225 Difference]: With dead ends: 51 [2025-02-08 06:42:17,899 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:42:17,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:17,900 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:17,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:42:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 06:42:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.6) internal successors, (56), 50 states have internal predecessors, (56), 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 06:42:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-02-08 06:42:17,905 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 12 [2025-02-08 06:42:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:17,905 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-02-08 06:42:17,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 06:42:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-02-08 06:42:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:42:17,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:17,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 06:42:17,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:42:18,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:18,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:18,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash 968901231, now seen corresponding path program 1 times [2025-02-08 06:42:18,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:18,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115862204] [2025-02-08 06:42:18,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:18,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:42:18,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:42:18,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115862204] [2025-02-08 06:42:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115862204] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375337292] [2025-02-08 06:42:18,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:18,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:18,243 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 06:42:18,246 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 06:42:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:42:18,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:42:18,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:42:18,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:18,324 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 06:42:18,352 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:42:18,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:42:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:18,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:18,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375337292] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:18,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:18,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-02-08 06:42:18,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446286594] [2025-02-08 06:42:18,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:18,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:42:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:18,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:42:18,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:18,392 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:18,458 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-02-08 06:42:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:42:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 06:42:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:18,459 INFO L225 Difference]: With dead ends: 50 [2025-02-08 06:42:18,459 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 06:42:18,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:18,460 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:18,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 06:42:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-08 06:42:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 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 06:42:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-02-08 06:42:18,465 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2025-02-08 06:42:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:18,465 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-02-08 06:42:18,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 06:42:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-02-08 06:42:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:42:18,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:18,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 06:42:18,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:18,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:18,668 INFO L85 PathProgramCache]: Analyzing trace with hash 968901232, now seen corresponding path program 1 times [2025-02-08 06:42:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:18,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004615359] [2025-02-08 06:42:18,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:18,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:42:18,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:42:18,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004615359] [2025-02-08 06:42:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004615359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515896973] [2025-02-08 06:42:18,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:18,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:18,854 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 06:42:18,856 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 06:42:18,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:42:18,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:42:18,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 06:42:18,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:18,931 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 06:42:18,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:18,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:42:18,981 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:18,981 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 06:42:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:19,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:19,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2025-02-08 06:42:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:19,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515896973] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:19,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:19,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 06:42:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484778621] [2025-02-08 06:42:19,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:42:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:19,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:42:19,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:42:19,192 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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 06:42:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:19,306 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-02-08 06:42:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:42:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 06:42:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:19,307 INFO L225 Difference]: With dead ends: 49 [2025-02-08 06:42:19,307 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:42:19,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:42:19,307 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:19,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 172 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:42:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:42:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.542857142857143) internal successors, (54), 48 states have internal predecessors, (54), 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 06:42:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-02-08 06:42:19,309 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2025-02-08 06:42:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:19,309 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-02-08 06:42:19,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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 06:42:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-02-08 06:42:19,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:42:19,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:19,310 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 06:42:19,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:42:19,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:19,511 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:19,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:19,511 INFO L85 PathProgramCache]: Analyzing trace with hash 60743337, now seen corresponding path program 2 times [2025-02-08 06:42:19,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:19,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983608179] [2025-02-08 06:42:19,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:19,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:19,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 06:42:19,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:42:19,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:19,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:19,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:19,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983608179] [2025-02-08 06:42:19,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983608179] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:19,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541524104] [2025-02-08 06:42:19,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:19,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:19,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:19,567 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 06:42:19,568 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 06:42:19,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 06:42:19,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:42:19,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:19,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:19,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:42:19,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:19,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541524104] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:19,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:19,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-08 06:42:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151811903] [2025-02-08 06:42:19,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:42:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:19,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:42:19,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:19,702 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 06:42:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:19,725 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-02-08 06:42:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:42:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-02-08 06:42:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:19,725 INFO L225 Difference]: With dead ends: 49 [2025-02-08 06:42:19,725 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:42:19,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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 06:42:19,726 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:19,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 110 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:42:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:42:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 48 states have internal predecessors, (53), 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 06:42:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-02-08 06:42:19,728 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 19 [2025-02-08 06:42:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:19,728 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-08 06:42:19,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 06:42:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-02-08 06:42:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:42:19,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:19,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:19,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:42:19,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 06:42:19,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:19,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1025124265, now seen corresponding path program 1 times [2025-02-08 06:42:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:19,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996520284] [2025-02-08 06:42:19,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:19,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:42:19,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:42:19,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:19,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:42:20,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:20,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996520284] [2025-02-08 06:42:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996520284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:20,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:20,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294338376] [2025-02-08 06:42:20,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:20,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:20,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:20,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:20,006 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:20,085 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-02-08 06:42:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 20 [2025-02-08 06:42:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:20,086 INFO L225 Difference]: With dead ends: 52 [2025-02-08 06:42:20,086 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 06:42:20,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:42:20,087 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:20,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 06:42:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 06:42:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 51 states have internal predecessors, (59), 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 06:42:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-02-08 06:42:20,088 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 20 [2025-02-08 06:42:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:20,089 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-02-08 06:42:20,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 06:42:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-02-08 06:42:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:42:20,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:20,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:20,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:42:20,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1025124266, now seen corresponding path program 1 times [2025-02-08 06:42:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245026074] [2025-02-08 06:42:20,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:20,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:42:20,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:42:20,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:20,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245026074] [2025-02-08 06:42:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245026074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:20,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:20,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:20,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103682336] [2025-02-08 06:42:20,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:20,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:20,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:20,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:20,278 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 06:42:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:20,358 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-02-08 06:42:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:20,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2025-02-08 06:42:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:20,359 INFO L225 Difference]: With dead ends: 52 [2025-02-08 06:42:20,359 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 06:42:20,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:42:20,360 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:20,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 114 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 06:42:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 06:42:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.5) internal successors, (57), 51 states have internal predecessors, (57), 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 06:42:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-02-08 06:42:20,362 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 20 [2025-02-08 06:42:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:20,362 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-02-08 06:42:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 06:42:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-02-08 06:42:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:42:20,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:20,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:20,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:42:20,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:20,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1713725720, now seen corresponding path program 1 times [2025-02-08 06:42:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:20,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67725780] [2025-02-08 06:42:20,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:20,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:42:20,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:42:20,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:20,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:42:20,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67725780] [2025-02-08 06:42:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67725780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:42:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770930299] [2025-02-08 06:42:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:42:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:20,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:42:20,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:20,409 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 06:42:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:20,425 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-02-08 06:42:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:42:20,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2025-02-08 06:42:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:20,426 INFO L225 Difference]: With dead ends: 57 [2025-02-08 06:42:20,426 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:42:20,427 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 06:42:20,427 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:20,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 63 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:42:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2025-02-08 06:42:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.4) internal successors, (49), 44 states have internal predecessors, (49), 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 06:42:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-08 06:42:20,432 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2025-02-08 06:42:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:20,432 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-08 06:42:20,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 06:42:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-08 06:42:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:42:20,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:20,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:20,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:42:20,432 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:20,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2035443256, now seen corresponding path program 1 times [2025-02-08 06:42:20,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:20,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135929353] [2025-02-08 06:42:20,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:20,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:42:20,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:42:20,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:20,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:42:20,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135929353] [2025-02-08 06:42:20,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135929353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:20,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:20,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:20,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555438154] [2025-02-08 06:42:20,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:20,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:20,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:20,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:20,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:20,518 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:20,552 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-02-08 06:42:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:20,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 06:42:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:20,553 INFO L225 Difference]: With dead ends: 54 [2025-02-08 06:42:20,553 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 06:42:20,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:42:20,553 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 44 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:20,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 90 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 06:42:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2025-02-08 06:42:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 48 states have internal predecessors, (54), 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 06:42:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-02-08 06:42:20,555 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 23 [2025-02-08 06:42:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:20,555 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-02-08 06:42:20,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:42:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-02-08 06:42:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:42:20,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:20,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:20,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:42:20,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:20,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:20,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2035443229, now seen corresponding path program 1 times [2025-02-08 06:42:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:20,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260940180] [2025-02-08 06:42:20,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:20,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:42:20,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:42:20,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:20,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:21,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260940180] [2025-02-08 06:42:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260940180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:21,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362344492] [2025-02-08 06:42:21,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:21,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:21,205 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 06:42:21,207 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 06:42:21,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:42:21,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:42:21,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:21,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:21,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 06:42:21,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:21,313 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 06:42:21,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:21,335 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 06:42:21,353 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 13 treesize of output 9 [2025-02-08 06:42:21,376 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 29 treesize of output 13 [2025-02-08 06:42:21,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:42:21,395 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 06:42:21,480 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 06:42:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:21,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:21,566 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-08 06:42:21,566 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 06:42:22,180 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_589 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_587)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2025-02-08 06:42:22,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:22,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2025-02-08 06:42:22,190 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 36 treesize of output 24 [2025-02-08 06:42:22,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:42:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 06:42:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362344492] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:22,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:22,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 27 [2025-02-08 06:42:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192296895] [2025-02-08 06:42:22,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:22,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:42:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:22,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:42:22,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=620, Unknown=10, NotChecked=50, Total=756 [2025-02-08 06:42:22,235 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 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 06:42:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:22,700 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2025-02-08 06:42:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:42:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 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 23 [2025-02-08 06:42:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:22,702 INFO L225 Difference]: With dead ends: 73 [2025-02-08 06:42:22,702 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 06:42:22,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=187, Invalid=1139, Unknown=10, NotChecked=70, Total=1406 [2025-02-08 06:42:22,703 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:22,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 258 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 445 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2025-02-08 06:42:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 06:42:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2025-02-08 06:42:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 57 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 06:42:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-02-08 06:42:22,708 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 23 [2025-02-08 06:42:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:22,708 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-02-08 06:42:22,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 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 06:42:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-02-08 06:42:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:42:22,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:22,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:22,717 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 06:42:22,911 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,SelfDestructingSolverStorable12 [2025-02-08 06:42:22,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:22,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2035443228, now seen corresponding path program 1 times [2025-02-08 06:42:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758513488] [2025-02-08 06:42:22,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:22,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:22,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:42:22,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:42:22,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:22,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:23,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:23,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758513488] [2025-02-08 06:42:23,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758513488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:23,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575257477] [2025-02-08 06:42:23,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:23,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:23,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:23,438 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 06:42:23,455 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 06:42:23,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:42:23,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:42:23,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:23,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-08 06:42:23,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:23,549 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 06:42:23,596 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:23,596 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 06:42:23,619 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 13 treesize of output 9 [2025-02-08 06:42:23,624 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 13 treesize of output 9 [2025-02-08 06:42:23,651 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 29 treesize of output 13 [2025-02-08 06:42:23,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 13 [2025-02-08 06:42:23,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:42:23,672 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 70 treesize of output 65 [2025-02-08 06:42:23,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-02-08 06:42:23,835 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 39 treesize of output 21 [2025-02-08 06:42:23,837 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 32 treesize of output 14 [2025-02-08 06:42:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:23,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:24,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:24,100 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 46 treesize of output 50 [2025-02-08 06:42:24,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_691 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_691) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (forall ((v_ArrVal_690 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_690) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2025-02-08 06:42:24,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_687 Int) (v_ArrVal_691 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_687)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_691) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (forall ((v_ArrVal_686 Int) (v_ArrVal_690 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_686)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_690) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_687 Int) (v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_687)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2025-02-08 06:42:24,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:24,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2025-02-08 06:42:24,150 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 40 treesize of output 28 [2025-02-08 06:42:24,157 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-08 06:42:24,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2025-02-08 06:42:24,161 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-08 06:42:24,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2025-02-08 06:42:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:42:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575257477] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:24,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:24,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2025-02-08 06:42:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194251527] [2025-02-08 06:42:24,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:24,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 06:42:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:24,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 06:42:24,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=850, Unknown=2, NotChecked=118, Total=1056 [2025-02-08 06:42:24,278 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 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 06:42:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:25,006 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-02-08 06:42:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:42:25,007 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 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 23 [2025-02-08 06:42:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:25,007 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:42:25,007 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 06:42:25,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=1450, Unknown=2, NotChecked=158, Total=1806 [2025-02-08 06:42:25,008 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:25,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 397 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 629 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2025-02-08 06:42:25,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 06:42:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2025-02-08 06:42:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 64 states have internal predecessors, (78), 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 06:42:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-02-08 06:42:25,016 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 23 [2025-02-08 06:42:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:25,016 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-02-08 06:42:25,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 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 06:42:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-02-08 06:42:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:42:25,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:25,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:25,024 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 06:42:25,222 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,SelfDestructingSolverStorable13 [2025-02-08 06:42:25,222 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:25,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1081848650, now seen corresponding path program 1 times [2025-02-08 06:42:25,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:25,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633365218] [2025-02-08 06:42:25,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:25,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:42:25,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:42:25,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:25,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:42:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633365218] [2025-02-08 06:42:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633365218] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238377965] [2025-02-08 06:42:25,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:25,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:25,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:25,274 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 06:42:25,276 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 06:42:25,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:42:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:42:25,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:25,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:25,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:42:25,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:42:25,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:42:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238377965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:25,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:42:25,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-08 06:42:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873756338] [2025-02-08 06:42:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:42:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:25,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:42:25,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:42:25,394 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 06:42:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:25,421 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2025-02-08 06:42:25,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:25,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 06:42:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:25,421 INFO L225 Difference]: With dead ends: 60 [2025-02-08 06:42:25,421 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 06:42:25,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:42:25,422 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:25,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:25,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 06:42:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-02-08 06:42:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 57 states have internal predecessors, (67), 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 06:42:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-02-08 06:42:25,424 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 25 [2025-02-08 06:42:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:25,424 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-02-08 06:42:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 06:42:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-02-08 06:42:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:42:25,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:25,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:25,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:25,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:25,626 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:25,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash 925783543, now seen corresponding path program 1 times [2025-02-08 06:42:25,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:25,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468782687] [2025-02-08 06:42:25,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:25,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:42:25,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:42:25,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:42:25,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468782687] [2025-02-08 06:42:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468782687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213145533] [2025-02-08 06:42:25,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:25,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:25,698 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 06:42:25,700 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 06:42:25,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:42:25,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:42:25,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:25,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:25,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:42:25,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:42:25,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:42:25,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213145533] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:25,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:25,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 06:42:25,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172950223] [2025-02-08 06:42:25,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:25,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:42:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:25,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:42:25,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:42:25,861 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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 06:42:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:25,881 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-02-08 06:42:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:42:25,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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 28 [2025-02-08 06:42:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:25,882 INFO L225 Difference]: With dead ends: 61 [2025-02-08 06:42:25,882 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 06:42:25,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:42:25,883 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:25,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 116 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 06:42:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 06:42:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 60 states have internal predecessors, (70), 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 06:42:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-02-08 06:42:25,887 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 28 [2025-02-08 06:42:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:25,887 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-02-08 06:42:25,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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 06:42:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-02-08 06:42:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:42:25,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:25,888 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:25,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:26,088 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,SelfDestructingSolverStorable15 [2025-02-08 06:42:26,089 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:26,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 961336039, now seen corresponding path program 1 times [2025-02-08 06:42:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:26,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47450434] [2025-02-08 06:42:26,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:26,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:42:26,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:42:26,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:26,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:42:26,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:26,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47450434] [2025-02-08 06:42:26,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47450434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:26,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376707322] [2025-02-08 06:42:26,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:26,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:26,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:26,164 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 06:42:26,169 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 06:42:26,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:42:26,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:42:26,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:26,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:26,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:42:26,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 06:42:26,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 06:42:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376707322] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:26,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2025-02-08 06:42:26,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529699886] [2025-02-08 06:42:26,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:26,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:42:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:26,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:42:26,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:42:26,336 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 06:42:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:26,388 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2025-02-08 06:42:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:42:26,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-08 06:42:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:26,389 INFO L225 Difference]: With dead ends: 43 [2025-02-08 06:42:26,389 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 06:42:26,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:42:26,390 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:26,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 124 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 06:42:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 06:42:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 42 states have internal predecessors, (45), 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 06:42:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-02-08 06:42:26,395 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 30 [2025-02-08 06:42:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:26,395 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-02-08 06:42:26,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 06:42:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-02-08 06:42:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:42:26,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:26,396 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:26,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:42:26,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:26,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1194965525, now seen corresponding path program 2 times [2025-02-08 06:42:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463232488] [2025-02-08 06:42:26,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:26,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-08 06:42:26,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:42:26,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:26,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 06:42:26,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:26,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463232488] [2025-02-08 06:42:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463232488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:26,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:26,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915882121] [2025-02-08 06:42:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:26,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:26,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:26,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:26,686 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 06:42:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:26,801 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-02-08 06:42:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:26,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 32 [2025-02-08 06:42:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:26,803 INFO L225 Difference]: With dead ends: 44 [2025-02-08 06:42:26,803 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 06:42:26,803 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 06:42:26,803 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:26,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 06:42:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 06:42:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 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 06:42:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-02-08 06:42:26,804 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2025-02-08 06:42:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:26,805 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-02-08 06:42:26,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 06:42:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-02-08 06:42:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:42:26,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:26,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:26,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:42:26,805 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:26,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1194965526, now seen corresponding path program 1 times [2025-02-08 06:42:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:26,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742848027] [2025-02-08 06:42:26,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:26,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:42:26,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:42:26,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:26,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:42:26,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:26,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742848027] [2025-02-08 06:42:26,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742848027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:26,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:26,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:26,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028716416] [2025-02-08 06:42:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:26,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:26,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:26,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:26,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:26,950 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 06:42:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:27,028 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-02-08 06:42:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 32 [2025-02-08 06:42:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:27,028 INFO L225 Difference]: With dead ends: 46 [2025-02-08 06:42:27,029 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:42:27,029 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 06:42:27,029 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:27,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:42:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 06:42:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 45 states have internal predecessors, (49), 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 06:42:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2025-02-08 06:42:27,031 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 32 [2025-02-08 06:42:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:27,032 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2025-02-08 06:42:27,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 06:42:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2025-02-08 06:42:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:42:27,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:27,032 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:27,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:42:27,032 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:27,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1194965166, now seen corresponding path program 1 times [2025-02-08 06:42:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:27,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968904268] [2025-02-08 06:42:27,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:27,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:42:27,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:42:27,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:42:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:27,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968904268] [2025-02-08 06:42:27,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968904268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:27,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:27,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:42:27,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695141326] [2025-02-08 06:42:27,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:27,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:27,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:27,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:27,094 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 06:42:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:27,159 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-02-08 06:42:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:27,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 32 [2025-02-08 06:42:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:27,160 INFO L225 Difference]: With dead ends: 48 [2025-02-08 06:42:27,160 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 06:42:27,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 06:42:27,161 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:27,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 72 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 06:42:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-02-08 06:42:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.170731707317073) internal successors, (48), 45 states have internal predecessors, (48), 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 06:42:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2025-02-08 06:42:27,162 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 32 [2025-02-08 06:42:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:27,162 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2025-02-08 06:42:27,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 06:42:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2025-02-08 06:42:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:42:27,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:27,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:27,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:42:27,162 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:27,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:27,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1765970272, now seen corresponding path program 1 times [2025-02-08 06:42:27,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:27,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094162566] [2025-02-08 06:42:27,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:27,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:27,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:27,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:27,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:42:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094162566] [2025-02-08 06:42:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094162566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605279570] [2025-02-08 06:42:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:27,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:27,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:27,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:27,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:27,258 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 06:42:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:27,312 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2025-02-08 06:42:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:27,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 06:42:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:27,313 INFO L225 Difference]: With dead ends: 47 [2025-02-08 06:42:27,313 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 06:42:27,313 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 06:42:27,314 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:27,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 06:42:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 06:42:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 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 06:42:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-02-08 06:42:27,315 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 35 [2025-02-08 06:42:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:27,316 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-02-08 06:42:27,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 06:42:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-02-08 06:42:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:42:27,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:27,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:27,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:42:27,317 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:27,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:27,317 INFO L85 PathProgramCache]: Analyzing trace with hash -965979026, now seen corresponding path program 1 times [2025-02-08 06:42:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901663157] [2025-02-08 06:42:27,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:27,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:27,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:27,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:27,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:42:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901663157] [2025-02-08 06:42:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901663157] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337932931] [2025-02-08 06:42:28,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:28,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:28,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:28,182 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 06:42:28,183 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 06:42:28,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:28,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:28,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:28,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:28,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-08 06:42:28,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:28,335 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 06:42:28,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:28,374 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 06:42:28,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:42:28,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-08 06:42:28,450 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:28,450 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 34 treesize of output 33 [2025-02-08 06:42:28,558 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:28,558 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 29 treesize of output 30 [2025-02-08 06:42:28,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:28,614 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 33 treesize of output 17 [2025-02-08 06:42:28,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:28,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2025-02-08 06:42:28,749 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 06:42:28,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:42:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:28,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:29,075 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1359 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (forall ((v_ArrVal_1360 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1359) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1360) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((v_ArrVal_1359 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (forall ((v_ArrVal_1360 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1359) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1360) 4)) 1))))) is different from false [2025-02-08 06:42:29,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1359 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (forall ((v_ArrVal_1360 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1359) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1360) 4)) 1)))) (forall ((v_ArrVal_1359 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (forall ((v_ArrVal_1360 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1359) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1360) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))))) is different from false [2025-02-08 06:42:29,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:29,418 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 69 treesize of output 73 [2025-02-08 06:42:29,464 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1358 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1358))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1359)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1360) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int))) (or (not (= (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_3)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_4) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))))) is different from false [2025-02-08 06:42:29,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_ArrVal_1356 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int))) (or (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_1356)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_3)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_4) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1356 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (= (select (store (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_1356)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1358))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1359)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1360) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2025-02-08 06:42:29,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:29,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2025-02-08 06:42:29,508 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 286 treesize of output 268 [2025-02-08 06:42:29,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:29,518 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 235 treesize of output 219 [2025-02-08 06:42:29,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:29,529 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 107 treesize of output 99 [2025-02-08 06:42:29,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-02-08 06:42:29,588 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-08 06:42:29,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 1 [2025-02-08 06:42:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-08 06:42:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337932931] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:29,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:29,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 20] total 42 [2025-02-08 06:42:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862148553] [2025-02-08 06:42:29,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:29,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-08 06:42:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:29,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-08 06:42:29,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1291, Unknown=55, NotChecked=308, Total=1806 [2025-02-08 06:42:29,640 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 43 states have internal predecessors, (92), 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 06:42:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:30,483 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-02-08 06:42:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:42:30,484 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 43 states have internal predecessors, (92), 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 38 [2025-02-08 06:42:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:30,484 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:42:30,484 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:42:30,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=1967, Unknown=56, NotChecked=380, Total=2652 [2025-02-08 06:42:30,486 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:30,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 177 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 916 Invalid, 0 Unknown, 203 Unchecked, 0.5s Time] [2025-02-08 06:42:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:42:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-02-08 06:42:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 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 06:42:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-02-08 06:42:30,488 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 38 [2025-02-08 06:42:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:30,488 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-02-08 06:42:30,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 43 states have internal predecessors, (92), 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 06:42:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-02-08 06:42:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:42:30,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:30,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:30,508 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 06:42:30,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:30,689 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:30,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:30,689 INFO L85 PathProgramCache]: Analyzing trace with hash -965979025, now seen corresponding path program 1 times [2025-02-08 06:42:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:30,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078451792] [2025-02-08 06:42:30,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:30,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:30,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:30,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:30,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:30,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:42:31,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:31,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078451792] [2025-02-08 06:42:31,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078451792] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:31,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230324582] [2025-02-08 06:42:31,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:31,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:31,537 INFO L229 MonitoredProcess]: Starting monitored process 12 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 06:42:31,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:42:31,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:31,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:31,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:31,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-08 06:42:31,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:31,678 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 06:42:31,680 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 06:42:31,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:31,747 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 06:42:31,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:42:31,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:42:31,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:42:31,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-08 06:42:31,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-08 06:42:31,849 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:31,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 06:42:31,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:42:31,974 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:31,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 06:42:31,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:42:32,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:32,032 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 33 treesize of output 17 [2025-02-08 06:42:32,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:32,035 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 23 treesize of output 11 [2025-02-08 06:42:32,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:32,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 15 [2025-02-08 06:42:32,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:32,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2025-02-08 06:42:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:32,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:32,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1497 (Array Int Int))) (or (not (= v_ArrVal_1497 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1497 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1497) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_1497 (Array Int Int))) (or (forall ((v_ArrVal_1496 Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1497) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1496)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= v_ArrVal_1497 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1497 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))))) is different from false [2025-02-08 06:42:32,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1493 (Array Int Int)) (v_DerPreprocessor_2 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1493) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4))))) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_DerPreprocessor_1 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1493) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1494) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1496) 4))))))) is different from false [2025-02-08 06:42:33,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_DerPreprocessor_2 Int) (v_ArrVal_1491 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< 0 (+ 5 (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1492) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1491) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1493) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4))))) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_DerPreprocessor_1 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1491))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (< (+ 7 (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1492) .cse1 v_ArrVal_1493) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4)) (select |c_#length| (select (store (select (store .cse2 .cse1 v_ArrVal_1494) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1496) 4))))))))) is different from false [2025-02-08 06:42:33,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1496 Int) (v_ArrVal_1488 Int) (v_ArrVal_1489 Int) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_DerPreprocessor_1 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse1 v_ArrVal_1488)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1491))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (< (+ (select (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1489)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1492) .cse2 v_ArrVal_1493) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4) 7) (select |c_#length| (select (store (select (store .cse3 .cse2 v_ArrVal_1494) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1496) 4))))))) (forall ((v_ArrVal_1488 Int) (v_ArrVal_1489 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_DerPreprocessor_2 Int) (v_ArrVal_1491 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< 0 (+ (select (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1489)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1492) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse1 v_ArrVal_1488)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1491) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4) v_ArrVal_1493) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4) 5)))))) is different from false [2025-02-08 06:42:33,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:33,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 117 [2025-02-08 06:42:33,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:33,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 72 [2025-02-08 06:42:33,210 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 786 treesize of output 748 [2025-02-08 06:42:33,218 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 2025 treesize of output 1991 [2025-02-08 06:42:33,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 711 treesize of output 695 [2025-02-08 06:42:33,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:33,252 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 729 treesize of output 725 [2025-02-08 06:42:33,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:33,276 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 743 treesize of output 691 [2025-02-08 06:42:33,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:33,312 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 226 treesize of output 208 [2025-02-08 06:42:33,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 221 [2025-02-08 06:42:33,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 150 [2025-02-08 06:42:33,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:33,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2025-02-08 06:42:33,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:33,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2025-02-08 06:42:33,472 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:42:33,474 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 31 treesize of output 23 [2025-02-08 06:42:33,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:42:33,478 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 21 treesize of output 17 [2025-02-08 06:42:33,480 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:42:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-08 06:42:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-08 06:42:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230324582] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:33,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:33,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 20] total 49 [2025-02-08 06:42:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936757823] [2025-02-08 06:42:33,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:33,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-08 06:42:33,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:33,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-08 06:42:33,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1843, Unknown=78, NotChecked=364, Total=2450 [2025-02-08 06:42:33,707 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 50 states have internal predecessors, (103), 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 06:42:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:34,794 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-02-08 06:42:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:42:34,794 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 50 states have internal predecessors, (103), 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 38 [2025-02-08 06:42:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:34,795 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:42:34,795 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:42:34,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=306, Invalid=2933, Unknown=83, NotChecked=460, Total=3782 [2025-02-08 06:42:34,796 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:34,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 276 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1030 Invalid, 0 Unknown, 195 Unchecked, 0.5s Time] [2025-02-08 06:42:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:42:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-02-08 06:42:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 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 06:42:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-02-08 06:42:34,797 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 38 [2025-02-08 06:42:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:34,797 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-02-08 06:42:34,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 50 states have internal predecessors, (103), 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 06:42:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-02-08 06:42:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:42:34,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:34,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:34,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:42:35,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 06:42:35,002 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:35,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash -965979385, now seen corresponding path program 1 times [2025-02-08 06:42:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:35,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234870002] [2025-02-08 06:42:35,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:35,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:35,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:35,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:35,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:42:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:35,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234870002] [2025-02-08 06:42:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234870002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:35,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083773328] [2025-02-08 06:42:35,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:35,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:35,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:35,742 INFO L229 MonitoredProcess]: Starting monitored process 13 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 06:42:35,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:42:35,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:35,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:35,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:35,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:35,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 06:42:35,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:35,895 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 06:42:35,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:35,915 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 06:42:35,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:42:35,943 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 31 treesize of output 15 [2025-02-08 06:42:35,979 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:35,980 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 33 treesize of output 32 [2025-02-08 06:42:36,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:36,073 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 33 treesize of output 32 [2025-02-08 06:42:36,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:36,115 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 32 treesize of output 16 [2025-02-08 06:42:36,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:36,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 20 [2025-02-08 06:42:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:36,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:36,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1623 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1623) 4) 0)))) is different from false [2025-02-08 06:42:36,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1623 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1621) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1623) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2025-02-08 06:42:36,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1623 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (not (= 0 (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1621) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1623) 4))))) is different from false [2025-02-08 06:42:36,370 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1623 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1621) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1623) 4) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2025-02-08 06:42:36,424 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1623 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (not (= 0 (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1620))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1621)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1623) 4))))) is different from false [2025-02-08 06:42:36,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:36,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2025-02-08 06:42:36,525 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 171 treesize of output 159 [2025-02-08 06:42:36,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2025-02-08 06:42:36,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:36,538 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 120 treesize of output 114 [2025-02-08 06:42:36,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:36,547 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 84 treesize of output 83 [2025-02-08 06:42:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-08 06:42:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083773328] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:36,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:36,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 22] total 44 [2025-02-08 06:42:36,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922800588] [2025-02-08 06:42:36,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:36,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-08 06:42:36,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:36,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-08 06:42:36,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1327, Unknown=15, NotChecked=390, Total=1892 [2025-02-08 06:42:36,742 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 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 06:42:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:37,628 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2025-02-08 06:42:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:42:37,628 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 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 38 [2025-02-08 06:42:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:37,628 INFO L225 Difference]: With dead ends: 60 [2025-02-08 06:42:37,628 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 06:42:37,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=345, Invalid=2626, Unknown=19, NotChecked=550, Total=3540 [2025-02-08 06:42:37,630 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:37,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 302 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 913 Invalid, 2 Unknown, 237 Unchecked, 0.4s Time] [2025-02-08 06:42:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 06:42:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2025-02-08 06:42:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.148936170212766) internal successors, (54), 51 states have internal predecessors, (54), 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 06:42:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-02-08 06:42:37,631 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 38 [2025-02-08 06:42:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:37,631 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-02-08 06:42:37,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 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 06:42:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-02-08 06:42:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:42:37,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:37,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:37,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:42:37,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:37,832 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:37,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1200289369, now seen corresponding path program 1 times [2025-02-08 06:42:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:37,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070408600] [2025-02-08 06:42:37,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:37,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:42:37,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:42:37,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:37,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:42:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:38,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070408600] [2025-02-08 06:42:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070408600] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:38,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806943905] [2025-02-08 06:42:38,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:38,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:38,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:38,508 INFO L229 MonitoredProcess]: Starting monitored process 14 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 06:42:38,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:42:38,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:42:38,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:42:38,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:38,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:38,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 06:42:38,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:38,654 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 06:42:38,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:38,691 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 06:42:38,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:42:38,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-08 06:42:38,746 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:38,747 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 34 treesize of output 33 [2025-02-08 06:42:38,842 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:38,843 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 34 treesize of output 33 [2025-02-08 06:42:38,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:38,899 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 33 treesize of output 17 [2025-02-08 06:42:38,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2025-02-08 06:42:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:39,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:39,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1749 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1749) 4) |c_#StackHeapBarrier|))) is different from false [2025-02-08 06:42:39,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1749 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1749) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2025-02-08 06:42:39,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1749 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1747) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1749) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2025-02-08 06:42:39,206 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1749 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1747) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1749) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2025-02-08 06:42:39,268 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1749 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1747) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1749) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2025-02-08 06:42:39,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1749 Int) (v_ArrVal_1746 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1746))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1747)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1749) 4) |c_#StackHeapBarrier|))) is different from false [2025-02-08 06:42:39,286 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1749 Int) (v_ArrVal_1746 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_1744 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1744)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1746))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1747)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1749) 4) |c_#StackHeapBarrier|))) is different from false [2025-02-08 06:42:39,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:39,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2025-02-08 06:42:39,296 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 166 treesize of output 154 [2025-02-08 06:42:39,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2025-02-08 06:42:39,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:39,309 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 74 treesize of output 68 [2025-02-08 06:42:39,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:39,317 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 64 treesize of output 63 [2025-02-08 06:42:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-02-08 06:42:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806943905] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:39,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:39,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 20] total 41 [2025-02-08 06:42:39,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742383162] [2025-02-08 06:42:39,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:39,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:42:39,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:39,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:42:39,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1067, Unknown=13, NotChecked=504, Total=1722 [2025-02-08 06:42:39,461 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 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 06:42:40,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:40,184 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2025-02-08 06:42:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:42:40,185 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 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 41 [2025-02-08 06:42:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:40,185 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:42:40,185 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 06:42:40,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1843, Unknown=13, NotChecked=658, Total=2756 [2025-02-08 06:42:40,186 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:40,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 312 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 847 Invalid, 0 Unknown, 336 Unchecked, 0.4s Time] [2025-02-08 06:42:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 06:42:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2025-02-08 06:42:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 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 06:42:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2025-02-08 06:42:40,188 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 41 [2025-02-08 06:42:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:40,188 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2025-02-08 06:42:40,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 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 06:42:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2025-02-08 06:42:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:42:40,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:40,188 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:40,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:40,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:40,392 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:42:40,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2077100039, now seen corresponding path program 2 times [2025-02-08 06:42:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:40,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903438817] [2025-02-08 06:42:40,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:40,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 06:42:40,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:42:40,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:40,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903438817] [2025-02-08 06:42:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903438817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343325382] [2025-02-08 06:42:41,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:41,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:41,595 INFO L229 MonitoredProcess]: Starting monitored process 15 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 06:42:41,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:42:41,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 06:42:41,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:42:41,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:41,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:41,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-08 06:42:41,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:41,767 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 06:42:41,788 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 11 treesize of output 7 [2025-02-08 06:42:41,791 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 11 treesize of output 7 [2025-02-08 06:42:41,805 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 23 treesize of output 11 [2025-02-08 06:42:41,813 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 23 treesize of output 11 [2025-02-08 06:42:41,859 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:41,859 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 06:42:41,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:42:41,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:42:41,921 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 19 treesize of output 18 [2025-02-08 06:42:41,931 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 23 treesize of output 11 [2025-02-08 06:42:41,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-08 06:42:41,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-08 06:42:42,028 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:42:42,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2025-02-08 06:42:42,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-02-08 06:42:42,400 INFO L349 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2025-02-08 06:42:42,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2025-02-08 06:42:42,478 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2025-02-08 06:42:42,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 67 [2025-02-08 06:42:42,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:43,034 INFO L349 Elim1Store]: treesize reduction 156, result has 30.7 percent of original size [2025-02-08 06:42:43,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 173 treesize of output 188 [2025-02-08 06:42:43,080 INFO L349 Elim1Store]: treesize reduction 60, result has 46.4 percent of original size [2025-02-08 06:42:43,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 134 treesize of output 161 [2025-02-08 06:42:44,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:44,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 06:42:44,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:42:44,056 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:44,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2025-02-08 06:42:44,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:42:44,412 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:44,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2025-02-08 06:42:51,667 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 06:42:51,783 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-02-08 06:42:51,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 43 [2025-02-08 06:42:51,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:51,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-02-08 06:42:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:51,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:51,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 06:42:56,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (forall ((v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1891 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1891) .cse1) 4) 0) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1891 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1891))))) (forall ((v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= 0 (select (select .cse4 .cse5) 4)) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5)))))))) is different from false [2025-02-08 06:42:56,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|))))) (forall ((v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1891 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1891 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1891)) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1891) .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|))))))) is different from false [2025-02-08 06:42:56,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1891 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1891) .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (not (= v_ArrVal_1891 (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1891 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|))))))) (forall ((v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse4 .cse5) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))))))) is different from false [2025-02-08 06:42:56,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1890 Int) (v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1889 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 .cse3 v_ArrVal_1890)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1889)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|))))) (forall ((v_ArrVal_1890 Int) (v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1891 (Array Int Int)) (v_ArrVal_1889 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 .cse3 v_ArrVal_1890)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse9 (select (select (store .cse10 .cse8 (store (select .cse10 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1889)))) (or (= (select (select (store .cse7 .cse8 v_ArrVal_1891) .cse9) 4) 0) (not (= v_ArrVal_1891 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1891 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9) (< (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))))))) is different from false [2025-02-08 06:42:56,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1890 Int) (v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1883 Int) (v_ArrVal_1891 (Array Int Int)) (v_ArrVal_1885 Int) (v_ArrVal_1889 Int)) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse6 v_ArrVal_1885)))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_1890))))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select (store .cse7 .cse1 (store (select .cse7 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse6 v_ArrVal_1883)))) (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_1889))))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_1891) .cse2) 4) 0) (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= v_ArrVal_1891 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1891 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|))))))))) (forall ((v_ArrVal_1890 Int) (v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1883 Int) (v_ArrVal_1885 Int) (v_ArrVal_1889 Int)) (let ((.cse10 (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse6 v_ArrVal_1885)))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_1890))))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse13 .cse14 (store (select .cse13 .cse14) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)))))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse10 .cse11) 4) 0) (< (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse6 v_ArrVal_1883)))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_1889))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2025-02-08 06:42:57,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1881 Int)) (or (forall ((v_ArrVal_1890 Int) (v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1883 Int) (v_ArrVal_1885 Int) (v_ArrVal_1889 Int)) (let ((.cse0 (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse6 v_ArrVal_1885)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_1890))))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse4 .cse5 v_ArrVal_1881) .cse6 v_ArrVal_1883)))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_1889))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_ArrVal_1881))) (forall ((v_ArrVal_1881 Int)) (or (forall ((v_ArrVal_1890 Int) (v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1883 Int) (v_ArrVal_1891 (Array Int Int)) (v_ArrVal_1885 Int) (v_ArrVal_1889 Int)) (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse6 v_ArrVal_1885)))) (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_1890))))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse13 (select (select (store .cse15 .cse12 (store (select .cse15 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse11 (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse4 .cse5 v_ArrVal_1881) .cse6 v_ArrVal_1883)))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_1889))))) (or (= (select (select (store .cse11 .cse12 v_ArrVal_1891) .cse13) 4) 0) (< (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13) (not (= (store (select .cse11 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1891 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1891))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_ArrVal_1881)))))) is different from false [2025-02-08 06:42:57,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:57,093 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 381 treesize of output 337 [2025-02-08 06:42:57,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:57,106 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 465 treesize of output 281 [2025-02-08 06:42:57,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:57,152 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2025-02-08 06:42:57,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:57,164 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 499 treesize of output 275 [2025-02-08 06:42:57,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1893 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1891 (Array Int Int)) (v_ArrVal_1889 Int)) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_14))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1890))))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_13))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1889)))) (.cse3 (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1891 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1891)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse2)) (not (= (select v_arrayElimArr_14 .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= (select (select (store .cse0 .cse1 v_ArrVal_1891) .cse3) 4) 0)))))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1893 Int) (v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1889 Int)) (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_16))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1890))))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1893)))))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_16 .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select .cse9 .cse8) 4) 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_15 .cse2)) (< (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_15))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1889))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|))))))) is different from false [2025-02-08 06:42:58,869 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:42:58,950 INFO L349 Elim1Store]: treesize reduction 631, result has 46.4 percent of original size [2025-02-08 06:42:58,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3085 treesize of output 3226 [2025-02-08 06:42:58,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:59,017 INFO L349 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2025-02-08 06:42:59,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31627 treesize of output 17433 [2025-02-08 06:42:59,153 INFO L349 Elim1Store]: treesize reduction 50, result has 66.9 percent of original size [2025-02-08 06:42:59,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 1110 treesize of output 1125 [2025-02-08 06:42:59,203 INFO L349 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2025-02-08 06:42:59,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3257 treesize of output 3116 [2025-02-08 06:42:59,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3094 treesize of output 2870 [2025-02-08 06:42:59,459 INFO L349 Elim1Store]: treesize reduction 73, result has 37.1 percent of original size [2025-02-08 06:42:59,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 472 treesize of output 499 [2025-02-08 06:43:00,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:00,095 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 1 case distinctions, treesize of input 18 treesize of output 8 [2025-02-08 06:43:00,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-08 06:43:00,309 INFO L349 Elim1Store]: treesize reduction 52, result has 29.7 percent of original size [2025-02-08 06:43:00,310 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 3 case distinctions, treesize of input 38 treesize of output 37 [2025-02-08 06:43:00,352 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:00,352 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:00,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:00,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 17 [2025-02-08 06:43:00,396 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 9 treesize of output 1 [2025-02-08 06:43:00,627 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:00,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-08 06:43:00,640 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:00,641 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:00,644 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:43:00,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-02-08 06:43:00,668 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2025-02-08 06:43:00,668 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 31 treesize of output 26 [2025-02-08 06:43:00,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-02-08 06:43:00,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2025-02-08 06:43:00,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:00,725 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 357 treesize of output 353 [2025-02-08 06:43:00,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:01,001 INFO L349 Elim1Store]: treesize reduction 242, result has 34.4 percent of original size [2025-02-08 06:43:01,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 191035 treesize of output 117008 [2025-02-08 06:43:01,384 INFO L349 Elim1Store]: treesize reduction 65, result has 69.9 percent of original size [2025-02-08 06:43:01,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 5656 treesize of output 5497 [2025-02-08 06:43:01,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9929 treesize of output 9423 [2025-02-08 06:43:01,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:01,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 50 [2025-02-08 06:43:02,050 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 51 treesize of output 47 [2025-02-08 06:43:02,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-08 06:43:02,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2025-02-08 06:43:02,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:02,764 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 1 case distinctions, treesize of input 18 treesize of output 8 [2025-02-08 06:43:02,929 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2025-02-08 06:43:02,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 262 [2025-02-08 06:43:03,444 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:03,462 INFO L349 Elim1Store]: treesize reduction 16, result has 68.0 percent of original size [2025-02-08 06:43:03,462 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1612 treesize of output 1625 [2025-02-08 06:43:03,505 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:03,505 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:03,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2025-02-08 06:43:04,373 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:43:04,373 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 259 treesize of output 237 [2025-02-08 06:43:04,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:04,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-08 06:43:04,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:04,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-08 06:43:04,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 884 treesize of output 878 [2025-02-08 06:43:05,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 314 [2025-02-08 06:43:05,285 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:05,291 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:43:05,291 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 400 treesize of output 1 [2025-02-08 06:43:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2025-02-08 06:43:05,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343325382] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:43:05,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:43:05,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 27] total 64 [2025-02-08 06:43:05,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992867135] [2025-02-08 06:43:05,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:05,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-08 06:43:05,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:05,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-08 06:43:05,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3069, Unknown=20, NotChecked=826, Total=4160 [2025-02-08 06:43:05,665 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 65 states, 65 states have (on average 1.7384615384615385) internal successors, (113), 64 states have internal predecessors, (113), 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 06:43:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:08,654 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-02-08 06:43:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 06:43:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.7384615384615385) internal successors, (113), 64 states have internal predecessors, (113), 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 44 [2025-02-08 06:43:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:08,656 INFO L225 Difference]: With dead ends: 89 [2025-02-08 06:43:08,656 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 06:43:08,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=342, Invalid=4358, Unknown=20, NotChecked=980, Total=5700 [2025-02-08 06:43:08,658 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:08,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 487 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1161 Invalid, 0 Unknown, 378 Unchecked, 1.4s Time] [2025-02-08 06:43:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 06:43:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-02-08 06:43:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.1097560975609757) internal successors, (91), 86 states have internal predecessors, (91), 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 06:43:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-02-08 06:43:08,661 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 44 [2025-02-08 06:43:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:08,662 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-02-08 06:43:08,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.7384615384615385) internal successors, (113), 64 states have internal predecessors, (113), 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 06:43:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-02-08 06:43:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:43:08,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:08,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:08,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:43:08,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:43:08,867 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:43:08,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:08,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2077099680, now seen corresponding path program 2 times [2025-02-08 06:43:08,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:08,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751889233] [2025-02-08 06:43:08,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:08,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 06:43:08,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:43:08,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:08,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:43:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751889233] [2025-02-08 06:43:09,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751889233] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240259196] [2025-02-08 06:43:09,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:09,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:09,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:09,563 INFO L229 MonitoredProcess]: Starting monitored process 16 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 06:43:09,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:43:09,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 06:43:09,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:43:09,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:09,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:09,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 06:43:09,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:09,774 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2025-02-08 06:43:09,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2025-02-08 06:43:09,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:09,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-08 06:43:09,878 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:43:09,878 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 47 treesize of output 44 [2025-02-08 06:43:10,067 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2025-02-08 06:43:10,067 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 51 treesize of output 52 [2025-02-08 06:43:10,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:43:10,077 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 32 treesize of output 26 [2025-02-08 06:43:10,214 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-08 06:43:10,215 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 55 [2025-02-08 06:43:10,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:10,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 65 treesize of output 55 [2025-02-08 06:43:10,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2025-02-08 06:43:10,694 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-02-08 06:43:10,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2025-02-08 06:43:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:43:10,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:11,160 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2024 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) v_ArrVal_2024) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-02-08 06:43:11,162 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2024 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) v_ArrVal_2024) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-02-08 06:43:11,165 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2024 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) v_ArrVal_2024) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-02-08 06:43:11,169 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2023))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) v_ArrVal_2024)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2025-02-08 06:43:11,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2022 Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2022)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2023))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) v_ArrVal_2024)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-02-08 06:43:11,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:11,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 51 [2025-02-08 06:43:11,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:11,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 178 treesize of output 160 [2025-02-08 06:43:11,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2025-02-08 06:43:11,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2025-02-08 06:43:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-02-08 06:43:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240259196] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:43:28,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:43:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 54 [2025-02-08 06:43:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115391100] [2025-02-08 06:43:28,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:28,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-08 06:43:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:28,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-08 06:43:28,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2373, Unknown=13, NotChecked=510, Total=3080 [2025-02-08 06:43:28,298 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 56 states, 55 states have (on average 2.1454545454545455) internal successors, (118), 55 states have internal predecessors, (118), 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 06:43:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:29,461 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2025-02-08 06:43:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:43:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.1454545454545455) internal successors, (118), 55 states have internal predecessors, (118), 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 44 [2025-02-08 06:43:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:29,463 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:43:29,463 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 06:43:29,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=271, Invalid=3396, Unknown=13, NotChecked=610, Total=4290 [2025-02-08 06:43:29,464 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:29,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 356 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 938 Invalid, 1 Unknown, 276 Unchecked, 0.7s Time] [2025-02-08 06:43:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 06:43:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 06:43:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.125) internal successors, (63), 60 states have internal predecessors, (63), 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 06:43:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2025-02-08 06:43:29,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 44 [2025-02-08 06:43:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:29,466 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2025-02-08 06:43:29,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.1454545454545455) internal successors, (118), 55 states have internal predecessors, (118), 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 06:43:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2025-02-08 06:43:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:43:29,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:29,466 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:29,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:29,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-08 06:43:29,669 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:43:29,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1914026784, now seen corresponding path program 3 times [2025-02-08 06:43:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:29,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100160265] [2025-02-08 06:43:29,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:43:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:29,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-02-08 06:43:29,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:43:29,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 06:43:29,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 06:43:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100160265] [2025-02-08 06:43:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100160265] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081391895] [2025-02-08 06:43:29,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:43:29,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:29,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:29,783 INFO L229 MonitoredProcess]: Starting monitored process 17 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 06:43:29,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:43:29,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-02-08 06:43:30,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:43:30,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 06:43:30,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:30,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:43:30,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 06:43:30,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:43:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081391895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:43:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 06:43:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475361210] [2025-02-08 06:43:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:30,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:43:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:30,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:43:30,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:30,243 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 06:43:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:30,249 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2025-02-08 06:43:30,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:43:30,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 52 [2025-02-08 06:43:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:30,249 INFO L225 Difference]: With dead ends: 17 [2025-02-08 06:43:30,249 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:43:30,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:30,249 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:30,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:43:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:43:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 06:43:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:43:30,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2025-02-08 06:43:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:30,250 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:43:30,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 06:43:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:43:30,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:43:30,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2025-02-08 06:43:30,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (21 of 23 remaining) [2025-02-08 06:43:30,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (20 of 23 remaining) [2025-02-08 06:43:30,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (19 of 23 remaining) [2025-02-08 06:43:30,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (18 of 23 remaining) [2025-02-08 06:43:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-02-08 06:43:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-02-08 06:43:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2025-02-08 06:43:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2025-02-08 06:43:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-02-08 06:43:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-02-08 06:43:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2025-02-08 06:43:30,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 06:43:30,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 06:43:30,460 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:30,462 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:43:30,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:43:30 BoogieIcfgContainer [2025-02-08 06:43:30,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:43:30,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:43:30,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:43:30,467 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:43:30,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:42:16" (3/4) ... [2025-02-08 06:43:30,469 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:43:30,473 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure myexit [2025-02-08 06:43:30,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 06:43:30,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 06:43:30,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 06:43:30,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:43:30,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:43:30,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:43:30,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:43:30,535 INFO L158 Benchmark]: Toolchain (without parser) took 74363.63ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 121.0MB in the beginning and 610.3MB in the end (delta: -489.3MB). Peak memory consumption was 618.8MB. Max. memory is 16.1GB. [2025-02-08 06:43:30,535 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:43:30,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.96ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 103.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:43:30,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.81ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 101.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:43:30,536 INFO L158 Benchmark]: Boogie Preprocessor took 32.84ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:43:30,536 INFO L158 Benchmark]: IcfgBuilder took 315.71ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 80.6MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:43:30,537 INFO L158 Benchmark]: TraceAbstraction took 73552.03ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 79.7MB in the beginning and 618.6MB in the end (delta: -538.9MB). Peak memory consumption was 568.5MB. Max. memory is 16.1GB. [2025-02-08 06:43:30,537 INFO L158 Benchmark]: Witness Printer took 68.00ms. Allocated memory is still 1.3GB. Free memory was 618.6MB in the beginning and 610.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:43:30,538 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.96ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 103.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.81ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 101.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.84ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 315.71ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 80.6MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 73552.03ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 79.7MB in the beginning and 618.6MB in the end (delta: -538.9MB). Peak memory consumption was 568.5MB. Max. memory is 16.1GB. * Witness Printer took 68.00ms. Allocated memory is still 1.3GB. Free memory was 618.6MB in the beginning and 610.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 73.5s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 745 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 745 mSDsluCounter, 4337 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1770 IncrementalHoareTripleChecker+Unchecked, 3583 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7891 IncrementalHoareTripleChecker+Invalid, 9797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 754 mSDtfsCounter, 7891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1260 GetRequests, 674 SyntacticMatches, 55 SemanticMatches, 531 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 5205 ImplicationChecksByTransitivity, 37.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=26, InterpolantAutomatonStates: 262, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 90 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 57.2s InterpolantComputationTime, 1206 NumberOfCodeBlocks, 1206 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1556 ConstructedInterpolants, 184 QuantifiedInterpolants, 42051 SizeOfPredicates, 65 NumberOfNonLiveVariables, 4476 ConjunctsInSsa, 593 ConjunctsInUnsatCore, 58 InterpolantComputations, 14 PerfectInterpolantSequences, 376/821 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:43:30,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE