./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_equal.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/sll2n_prepend_equal.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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:43:55,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:43:56,017 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:43:56,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:43:56,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:43:56,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:43:56,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:43:56,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:43:56,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:43:56,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:43:56,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:43:56,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:43:56,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:43:56,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:43:56,047 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:43:56,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:43:56,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:43:56,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:43:56,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:43:56,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:43:56,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:43:56,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:43:56,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:43:56,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:43:56,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:43:56,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:43:56,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:43:56,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:43:56,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:43:56,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:43:56,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:43:56,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:43:56,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:43:56,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:43:56,050 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2025-02-08 06:43:56,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:43:56,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:43:56,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:43:56,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:43:56,279 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:43:56,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2025-02-08 06:43:57,427 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a66a5b9/0e219c3e7b17428b99f6bbf5e7af9e1c/FLAG357fe09e8 [2025-02-08 06:43:57,689 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:43:57,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2025-02-08 06:43:57,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a66a5b9/0e219c3e7b17428b99f6bbf5e7af9e1c/FLAG357fe09e8 [2025-02-08 06:43:57,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a66a5b9/0e219c3e7b17428b99f6bbf5e7af9e1c [2025-02-08 06:43:57,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:43:57,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:43:57,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:43:57,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:43:57,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:43:57,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:57,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390e58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57, skipping insertion in model container [2025-02-08 06:43:57,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:57,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:43:57,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:43:57,955 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:43:57,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:43:57,995 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:43:57,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57 WrapperNode [2025-02-08 06:43:57,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:43:57,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:43:57,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:43:57,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:43:58,001 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:43:57" (1/1) ... [2025-02-08 06:43:58,008 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:43:57" (1/1) ... [2025-02-08 06:43:58,020 INFO L138 Inliner]: procedures = 127, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2025-02-08 06:43:58,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:43:58,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:43:58,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:43:58,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:43:58,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,039 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2025-02-08 06:43:58,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:43:58,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:43:58,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:43:58,048 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:43:58,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (1/1) ... [2025-02-08 06:43:58,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:43:58,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:58,077 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:43:58,084 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:43:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:43:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:43:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:43:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:43:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:43:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:43:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 06:43:58,101 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:43:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:43:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:43:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:43:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:43:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:43:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:43:58,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:43:58,183 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:43:58,184 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:43:58,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:43:58,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:43:58,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:43:58,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:43:58,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L607: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 06:43:58,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: 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;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 06:43:58,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:43:58,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 06:43:58,374 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-02-08 06:43:58,374 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:43:58,382 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:43:58,382 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:43:58,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:43:58 BoogieIcfgContainer [2025-02-08 06:43:58,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:43:58,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:43:58,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:43:58,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:43:58,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:43:57" (1/3) ... [2025-02-08 06:43:58,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b15b181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:43:58, skipping insertion in model container [2025-02-08 06:43:58,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:57" (2/3) ... [2025-02-08 06:43:58,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b15b181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:43:58, skipping insertion in model container [2025-02-08 06:43:58,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:43:58" (3/3) ... [2025-02-08 06:43:58,392 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2025-02-08 06:43:58,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:43:58,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_equal.i that has 2 procedures, 67 locations, 1 initial locations, 3 loop locations, and 27 error locations. [2025-02-08 06:43:58,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:43:58,444 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;@571e4293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:43:58,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-08 06:43:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:43:58,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:58,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:43:58,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:43:58,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1366609353, now seen corresponding path program 1 times [2025-02-08 06:43:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992301768] [2025-02-08 06:43:58,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:58,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:58,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:43:58,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:43:58,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:58,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:58,634 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:43:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992301768] [2025-02-08 06:43:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992301768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:58,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:58,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:43:58,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926169473] [2025-02-08 06:43:58,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:58,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:58,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:58,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:58,658 INFO L87 Difference]: Start difference. First operand has 67 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:43:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:58,720 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2025-02-08 06:43:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:58,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 6 [2025-02-08 06:43:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:58,726 INFO L225 Difference]: With dead ends: 65 [2025-02-08 06:43:58,726 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 06:43:58,728 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:43:58,730 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:58,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 06:43:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 06:43:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-02-08 06:43:58,751 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 6 [2025-02-08 06:43:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:58,752 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-02-08 06:43:58,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:43:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-02-08 06:43:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:43:58,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:58,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:43:58,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:43:58,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:43:58,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1366609352, now seen corresponding path program 1 times [2025-02-08 06:43:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:58,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813731732] [2025-02-08 06:43:58,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:58,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:43:58,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:43:58,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:58,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:58,845 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:43:58,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:58,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813731732] [2025-02-08 06:43:58,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813731732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:58,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:58,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:43:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584493077] [2025-02-08 06:43:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:58,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:58,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:58,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:58,847 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:43:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:58,877 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2025-02-08 06:43:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:58,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 6 [2025-02-08 06:43:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:58,878 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:43:58,878 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 06:43:58,879 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:43:58,879 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 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:43:58,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 06:43:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 06:43:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2025-02-08 06:43:58,883 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 6 [2025-02-08 06:43:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:58,883 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2025-02-08 06:43:58,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:43:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2025-02-08 06:43:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:43:58,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:58,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:58,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:43:58,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:43:58,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash -111498025, now seen corresponding path program 1 times [2025-02-08 06:43:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:58,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908335546] [2025-02-08 06:43:58,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:58,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:43:58,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:43:58,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:58,969 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:43:58,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:58,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908335546] [2025-02-08 06:43:58,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908335546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:58,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:58,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:43:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94299245] [2025-02-08 06:43:58,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:58,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:58,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:58,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:58,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:58,971 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:59,053 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-02-08 06:43:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:59,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 06:43:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:59,054 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:43:59,054 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:43:59,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:59,055 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:59,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:43:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-08 06:43:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2025-02-08 06:43:59,058 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 12 [2025-02-08 06:43:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:59,059 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2025-02-08 06:43:59,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2025-02-08 06:43:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:43:59,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:59,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:59,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:43:59,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:43:59,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash -111498024, now seen corresponding path program 1 times [2025-02-08 06:43:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163785929] [2025-02-08 06:43:59,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:59,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:43:59,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:43:59,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:59,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:59,237 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:43:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163785929] [2025-02-08 06:43:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163785929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:59,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:59,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:43:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484601284] [2025-02-08 06:43:59,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:59,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:59,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:59,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:59,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:59,238 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:59,307 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-02-08 06:43:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:59,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 06:43:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:59,308 INFO L225 Difference]: With dead ends: 57 [2025-02-08 06:43:59,308 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:43:59,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:59,309 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:59,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:43:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 06:43:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-02-08 06:43:59,312 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 12 [2025-02-08 06:43:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:59,313 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-02-08 06:43:59,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-02-08 06:43:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:43:59,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:59,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:43:59,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:43:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash -24715536, now seen corresponding path program 1 times [2025-02-08 06:43:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596321044] [2025-02-08 06:43:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:59,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:43:59,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:43:59,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:59,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:59,376 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:43:59,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:59,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596321044] [2025-02-08 06:43:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596321044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:59,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:43:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538104419] [2025-02-08 06:43:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:59,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:59,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:59,378 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:59,386 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2025-02-08 06:43:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 06:43:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:59,388 INFO L225 Difference]: With dead ends: 62 [2025-02-08 06:43:59,388 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 06:43:59,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:59,388 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 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:43:59,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 06:43:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-02-08 06:43:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2025-02-08 06:43:59,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 12 [2025-02-08 06:43:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:59,394 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2025-02-08 06:43:59,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2025-02-08 06:43:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:43:59,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:59,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:59,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:43:59,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:43:59,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash 107507372, now seen corresponding path program 1 times [2025-02-08 06:43:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:59,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531041390] [2025-02-08 06:43:59,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:59,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:59,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:59,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:59,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 06:43:59,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531041390] [2025-02-08 06:43:59,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531041390] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076530303] [2025-02-08 06:43:59,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:59,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:59,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:59,499 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:43:59,500 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:43:59,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:59,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:59,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:59,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:59,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:43:59,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:59,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 06:43:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076530303] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:43:59,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:43:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-08 06:43:59,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709588420] [2025-02-08 06:43:59,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:59,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:43:59,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:59,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:43:59,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:43:59,713 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:43:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:59,730 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-02-08 06:43:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:43:59,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-02-08 06:43:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:59,731 INFO L225 Difference]: With dead ends: 63 [2025-02-08 06:43:59,731 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:43:59,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 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:43:59,732 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:59,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:43:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 06:43:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.564102564102564) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-02-08 06:43:59,738 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 24 [2025-02-08 06:43:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:59,738 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-02-08 06:43:59,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:43:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-02-08 06:43:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:43:59,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:59,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:59,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:59,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:59,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:43:59,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1650178968, now seen corresponding path program 2 times [2025-02-08 06:43:59,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:59,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71881077] [2025-02-08 06:43:59,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:59,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:43:59,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:43:59,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:59,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:44:00,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:00,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71881077] [2025-02-08 06:44:00,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71881077] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:00,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693947717] [2025-02-08 06:44:00,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:44:00,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:00,418 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:44:00,423 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:44:00,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:44:00,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:44:00,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:44:00,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:00,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:44:00,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:00,572 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:44:00,588 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 5 treesize of output 3 [2025-02-08 06:44:00,630 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:44:00,631 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 14 treesize of output 13 [2025-02-08 06:44:00,732 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 5 treesize of output 3 [2025-02-08 06:44:00,748 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:44:00,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:00,804 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:44:00,842 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 5 treesize of output 3 [2025-02-08 06:44:00,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:00,880 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:44:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 12 not checked. [2025-02-08 06:44:00,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693947717] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:00,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:44:00,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-02-08 06:44:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918864059] [2025-02-08 06:44:00,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:00,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:44:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:00,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:44:00,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:44:00,943 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:44:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:01,202 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2025-02-08 06:44:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:44:01,203 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 36 [2025-02-08 06:44:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:01,203 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:44:01,204 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 06:44:01,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=346, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:44:01,204 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:01,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 201 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 303 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2025-02-08 06:44:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 06:44:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2025-02-08 06:44:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2025-02-08 06:44:01,207 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 36 [2025-02-08 06:44:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2025-02-08 06:44:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:44:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2025-02-08 06:44:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:44:01,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:01,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:01,217 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:44:01,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:01,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:01,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1650178967, now seen corresponding path program 1 times [2025-02-08 06:44:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:01,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415405573] [2025-02-08 06:44:01,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:44:01,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:44:01,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:01,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 06:44:01,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:01,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415405573] [2025-02-08 06:44:01,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415405573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:01,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926671380] [2025-02-08 06:44:01,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:01,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:01,892 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:44:01,893 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:44:01,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:44:01,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:44:01,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:01,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:01,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:44:01,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:02,000 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:44:02,012 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 5 treesize of output 3 [2025-02-08 06:44:02,018 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-08 06:44:02,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:02,046 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:44:02,070 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 5 treesize of output 3 [2025-02-08 06:44:02,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:02,101 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:44:02,129 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 5 treesize of output 3 [2025-02-08 06:44:02,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:02,158 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:44:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 06:44:02,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:44:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926671380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:02,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:44:02,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-02-08 06:44:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245548514] [2025-02-08 06:44:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:02,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:44:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:02,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:44:02,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-02-08 06:44:02,165 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:44:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:02,219 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2025-02-08 06:44:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:44:02,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-02-08 06:44:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:02,220 INFO L225 Difference]: With dead ends: 57 [2025-02-08 06:44:02,220 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:44:02,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:44:02,221 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:02,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 117 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 78 Unchecked, 0.0s Time] [2025-02-08 06:44:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:44:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 06:44:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-02-08 06:44:02,224 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 36 [2025-02-08 06:44:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:02,224 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-02-08 06:44:02,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:44:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-02-08 06:44:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:44:02,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:02,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:02,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:44:02,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:02,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:02,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash 384059567, now seen corresponding path program 1 times [2025-02-08 06:44:02,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:02,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095437566] [2025-02-08 06:44:02,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:02,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:02,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:44:02,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:44:02,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:02,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 06:44:02,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095437566] [2025-02-08 06:44:02,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095437566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:02,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:02,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:44:02,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591211801] [2025-02-08 06:44:02,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:02,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:44:02,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:02,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:44:02,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:44:02,499 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:44:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:02,555 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-02-08 06:44:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:44:02,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-02-08 06:44:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:02,556 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:44:02,556 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:44:02,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:44:02,557 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:02,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 146 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:44:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 06:44:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-02-08 06:44:02,559 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 37 [2025-02-08 06:44:02,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:02,560 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-02-08 06:44:02,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:44:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-02-08 06:44:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:44:02,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:02,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:44:02,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:02,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash 384059568, now seen corresponding path program 1 times [2025-02-08 06:44:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664773420] [2025-02-08 06:44:02,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:02,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:44:02,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:44:02,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:02,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 06:44:02,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664773420] [2025-02-08 06:44:02,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664773420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:02,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:02,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:44:02,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335272667] [2025-02-08 06:44:02,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:02,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:44:02,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:02,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:44:02,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:44:02,696 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:44:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:02,743 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2025-02-08 06:44:02,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:44:02,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-02-08 06:44:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:02,744 INFO L225 Difference]: With dead ends: 55 [2025-02-08 06:44:02,744 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 06:44:02,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:44:02,745 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:02,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 06:44:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 06:44:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.358974358974359) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-02-08 06:44:02,747 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 37 [2025-02-08 06:44:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:02,747 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-02-08 06:44:02,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:44:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-02-08 06:44:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:44:02,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:02,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:02,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:44:02,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:02,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash 86811370, now seen corresponding path program 1 times [2025-02-08 06:44:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:02,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373040600] [2025-02-08 06:44:02,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:02,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:44:02,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:44:02,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:02,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 06:44:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:02,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373040600] [2025-02-08 06:44:02,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373040600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:02,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:02,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:44:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079523838] [2025-02-08 06:44:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:02,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:44:02,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:02,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:44:02,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:44:02,884 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:44:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:02,927 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2025-02-08 06:44:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:44:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-02-08 06:44:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:02,927 INFO L225 Difference]: With dead ends: 53 [2025-02-08 06:44:02,927 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 06:44:02,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:44:02,928 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:02,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 112 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 06:44:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-08 06:44:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-02-08 06:44:02,934 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 41 [2025-02-08 06:44:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:02,934 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-02-08 06:44:02,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:44:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-02-08 06:44:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:44:02,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:02,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:02,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:44:02,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:02,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash 627195522, now seen corresponding path program 1 times [2025-02-08 06:44:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:02,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064329174] [2025-02-08 06:44:02,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:02,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:44:02,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:44:02,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:02,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 06:44:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064329174] [2025-02-08 06:44:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064329174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:03,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:03,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:44:03,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67628243] [2025-02-08 06:44:03,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:03,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:44:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:03,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:44:03,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:44:03,127 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:44:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:03,216 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-02-08 06:44:03,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:44:03,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-02-08 06:44:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:03,217 INFO L225 Difference]: With dead ends: 54 [2025-02-08 06:44:03,217 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 06:44:03,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:44:03,217 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:03,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 06:44:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 06:44:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-02-08 06:44:03,220 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 44 [2025-02-08 06:44:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:03,220 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-02-08 06:44:03,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:44:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-02-08 06:44:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:44:03,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:03,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:03,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:44:03,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:03,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:03,221 INFO L85 PathProgramCache]: Analyzing trace with hash 627195523, now seen corresponding path program 1 times [2025-02-08 06:44:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:03,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667195823] [2025-02-08 06:44:03,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:03,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:44:03,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:44:03,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:03,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 06:44:03,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:03,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667195823] [2025-02-08 06:44:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667195823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:03,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:03,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:44:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830482992] [2025-02-08 06:44:03,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:03,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:44:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:03,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:44:03,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:44:03,512 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:44:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:03,630 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-02-08 06:44:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:44:03,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-02-08 06:44:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:03,631 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:44:03,631 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:44:03,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:44:03,632 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:03,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 216 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:44:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 06:44:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-02-08 06:44:03,634 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 44 [2025-02-08 06:44:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:03,634 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-02-08 06:44:03,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:44:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-02-08 06:44:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:44:03,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:03,635 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:44:03,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:44:03,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:03,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash 375408019, now seen corresponding path program 1 times [2025-02-08 06:44:03,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:03,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033356897] [2025-02-08 06:44:03,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:03,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:03,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:44:03,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:44:03,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 06:44:03,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:03,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033356897] [2025-02-08 06:44:03,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033356897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:03,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:03,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:44:03,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187212643] [2025-02-08 06:44:03,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:03,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:44:03,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:03,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:44:03,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:44:03,717 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:44:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:03,726 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-02-08 06:44:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:44:03,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2025-02-08 06:44:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:03,727 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:44:03,727 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:44:03,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:44:03,728 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 18 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:03,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:44:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2025-02-08 06:44:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.255813953488372) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-02-08 06:44:03,730 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 48 [2025-02-08 06:44:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:03,730 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-02-08 06:44:03,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:44:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-02-08 06:44:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:44:03,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:03,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:03,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:44:03,731 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:03,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1835166430, now seen corresponding path program 1 times [2025-02-08 06:44:03,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:03,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820229586] [2025-02-08 06:44:03,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:03,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:44:03,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:44:03,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:03,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:44:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820229586] [2025-02-08 06:44:04,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820229586] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597266747] [2025-02-08 06:44:04,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:04,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:04,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:04,559 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:44:04,561 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:44:04,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:44:04,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:44:04,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:04,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:04,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-08 06:44:04,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:04,742 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:44:04,865 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 9 treesize of output 3 [2025-02-08 06:44:04,927 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:44:04,927 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 21 [2025-02-08 06:44:05,053 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 17 treesize of output 13 [2025-02-08 06:44:05,126 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:05,127 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:05,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 23 [2025-02-08 06:44:05,131 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 15 treesize of output 1 [2025-02-08 06:44:05,198 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:05,198 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-08 06:44:05,203 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:05,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:05,205 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 23 treesize of output 18 [2025-02-08 06:44:05,268 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 21 treesize of output 9 [2025-02-08 06:44:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:44:05,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:05,456 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 68 treesize of output 64 [2025-02-08 06:44:09,621 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 46 treesize of output 36 [2025-02-08 06:44:09,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597266747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:09,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:44:09,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 37 [2025-02-08 06:44:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260970367] [2025-02-08 06:44:09,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:09,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 06:44:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:09,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 06:44:09,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2006, Unknown=1, NotChecked=0, Total=2162 [2025-02-08 06:44:09,971 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:44:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:10,951 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-02-08 06:44:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:44:10,952 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2025-02-08 06:44:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:10,952 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:44:10,952 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 06:44:10,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=318, Invalid=3463, Unknown=1, NotChecked=0, Total=3782 [2025-02-08 06:44:10,955 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 80 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:10,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 410 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:44:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 06:44:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 06:44:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-02-08 06:44:10,959 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 49 [2025-02-08 06:44:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:10,959 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-02-08 06:44:10,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:44:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-02-08 06:44:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:44:10,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:10,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:10,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:44:11,160 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,SelfDestructingSolverStorable14 [2025-02-08 06:44:11,160 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:11,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1835166429, now seen corresponding path program 1 times [2025-02-08 06:44:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:11,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968425574] [2025-02-08 06:44:11,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:11,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:44:11,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:44:11,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:11,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:44:12,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:12,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968425574] [2025-02-08 06:44:12,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968425574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:12,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535013076] [2025-02-08 06:44:12,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:12,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:12,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:12,189 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:44:12,190 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:44:12,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:44:12,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:44:12,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:12,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:12,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-08 06:44:12,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:12,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-02-08 06:44:12,527 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 9 treesize of output 3 [2025-02-08 06:44:12,685 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:44:12,686 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 24 treesize of output 27 [2025-02-08 06:44:12,702 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:44:12,702 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 15 treesize of output 15 [2025-02-08 06:44:12,962 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 17 treesize of output 13 [2025-02-08 06:44:12,967 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 17 treesize of output 13 [2025-02-08 06:44:13,067 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:13,092 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-02-08 06:44:13,092 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62 [2025-02-08 06:44:13,096 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:13,097 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 47 [2025-02-08 06:44:13,344 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 82 treesize of output 58 [2025-02-08 06:44:13,345 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 62 treesize of output 42 [2025-02-08 06:44:13,434 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:44:13,437 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:44:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:44:13,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:13,879 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 106 treesize of output 76 [2025-02-08 06:44:13,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:13,894 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 158 treesize of output 128 [2025-02-08 06:44:13,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:13,897 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 190 treesize of output 130 [2025-02-08 06:44:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535013076] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:14,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:44:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2025-02-08 06:44:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339537256] [2025-02-08 06:44:14,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-08 06:44:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:14,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-08 06:44:14,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2606, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 06:44:14,251 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:44:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:15,678 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-02-08 06:44:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 06:44:15,678 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2025-02-08 06:44:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:15,679 INFO L225 Difference]: With dead ends: 68 [2025-02-08 06:44:15,679 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 06:44:15,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=322, Invalid=5080, Unknown=0, NotChecked=0, Total=5402 [2025-02-08 06:44:15,682 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 83 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:15,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 571 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:44:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 06:44:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-08 06:44:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-02-08 06:44:15,689 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 49 [2025-02-08 06:44:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:15,689 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-02-08 06:44:15,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:44:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-02-08 06:44:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 06:44:15,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:15,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:15,696 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:44:15,890 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,SelfDestructingSolverStorable15 [2025-02-08 06:44:15,890 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:15,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash 852446259, now seen corresponding path program 1 times [2025-02-08 06:44:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568203732] [2025-02-08 06:44:15,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:15,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 06:44:15,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:44:15,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:15,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 06:44:16,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568203732] [2025-02-08 06:44:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568203732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766128961] [2025-02-08 06:44:16,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:16,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:16,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:16,027 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:44:16,029 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:44:16,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 06:44:16,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:44:16,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:16,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:16,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:44:16,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 06:44:16,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 06:44:16,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766128961] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:44:16,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:44:16,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2025-02-08 06:44:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720013835] [2025-02-08 06:44:16,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:16,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:44:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:16,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:44:16,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:44:16,308 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:44:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:16,463 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2025-02-08 06:44:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:44:16,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2025-02-08 06:44:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:16,464 INFO L225 Difference]: With dead ends: 80 [2025-02-08 06:44:16,465 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 06:44:16,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:44:16,466 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:16,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 258 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 06:44:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2025-02-08 06:44:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-02-08 06:44:16,468 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 53 [2025-02-08 06:44:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:16,468 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-02-08 06:44:16,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:44:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-02-08 06:44:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 06:44:16,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:16,472 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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:44:16,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:44:16,672 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,SelfDestructingSolverStorable16 [2025-02-08 06:44:16,673 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:16,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 68117122, now seen corresponding path program 2 times [2025-02-08 06:44:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:16,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258957459] [2025-02-08 06:44:16,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:44:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:16,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-08 06:44:16,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:44:16,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:44:16,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258957459] [2025-02-08 06:44:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258957459] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150134411] [2025-02-08 06:44:18,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:44:18,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:18,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:18,090 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:44:18,093 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:44:18,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-08 06:44:18,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:44:18,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:44:18,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:18,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-02-08 06:44:18,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:18,276 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:44:18,458 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:44:18,458 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:44:18,532 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 19 treesize of output 1 [2025-02-08 06:44:18,667 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 19 treesize of output 5 [2025-02-08 06:44:18,673 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:44:18,673 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 15 treesize of output 7 [2025-02-08 06:44:18,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:18,772 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 28 treesize of output 23 [2025-02-08 06:44:18,795 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-02-08 06:44:18,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2025-02-08 06:44:19,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 06:44:19,040 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 53 treesize of output 38 [2025-02-08 06:44:19,152 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:19,153 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:19,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 58 [2025-02-08 06:44:19,159 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:19,160 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2025-02-08 06:44:19,260 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:19,261 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 63 [2025-02-08 06:44:19,362 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 45 treesize of output 33 [2025-02-08 06:44:19,612 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:44:19,613 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 25 [2025-02-08 06:44:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:19,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:20,235 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 218 treesize of output 188 [2025-02-08 06:44:20,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:20,835 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 208 [2025-02-08 06:44:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150134411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:21,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:44:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 59 [2025-02-08 06:44:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630114517] [2025-02-08 06:44:21,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-08 06:44:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:21,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-08 06:44:21,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4871, Unknown=0, NotChecked=0, Total=5112 [2025-02-08 06:44:21,285 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 60 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 52 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:44:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:23,944 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2025-02-08 06:44:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 06:44:23,944 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 52 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2025-02-08 06:44:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:23,945 INFO L225 Difference]: With dead ends: 75 [2025-02-08 06:44:23,945 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 06:44:23,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=539, Invalid=8773, Unknown=0, NotChecked=0, Total=9312 [2025-02-08 06:44:23,947 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 99 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:23,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 639 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:44:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 06:44:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-02-08 06:44:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 66 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-02-08 06:44:23,949 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 54 [2025-02-08 06:44:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:23,949 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-02-08 06:44:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 52 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:44:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-02-08 06:44:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 06:44:23,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:23,950 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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:44:23,956 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:44:24,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:24,150 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:24,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash 68117123, now seen corresponding path program 2 times [2025-02-08 06:44:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422345188] [2025-02-08 06:44:24,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:44:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:24,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-08 06:44:24,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:44:24,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:44:24,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:26,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422345188] [2025-02-08 06:44:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422345188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:26,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652876049] [2025-02-08 06:44:26,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:44:26,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:26,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:26,123 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:44:26,124 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:44:26,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-08 06:44:26,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:44:26,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:44:26,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:26,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-02-08 06:44:26,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:26,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 8 treesize of output 1 [2025-02-08 06:44:26,675 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:44:26,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:44:26,681 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:44:26,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:44:26,800 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:44:27,017 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 43 treesize of output 19 [2025-02-08 06:44:27,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 06:44:27,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-02-08 06:44:27,027 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 15 treesize of output 7 [2025-02-08 06:44:27,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:27,383 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 51 treesize of output 34 [2025-02-08 06:44:27,394 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-02-08 06:44:27,395 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 1 case distinctions, treesize of input 22 treesize of output 29 [2025-02-08 06:44:27,417 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-08 06:44:27,418 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 28 treesize of output 30 [2025-02-08 06:44:27,431 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 20 treesize of output 15 [2025-02-08 06:44:27,812 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:44:27,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2025-02-08 06:44:28,028 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:28,029 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:28,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 62 [2025-02-08 06:44:28,035 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:28,037 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:28,061 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-02-08 06:44:28,062 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 51 [2025-02-08 06:44:28,470 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-08 06:44:28,470 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 327 treesize of output 267 [2025-02-08 06:44:28,510 INFO L349 Elim1Store]: treesize reduction 20, result has 67.2 percent of original size [2025-02-08 06:44:28,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 255 treesize of output 227 [2025-02-08 06:44:29,186 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2025-02-08 06:44:29,186 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 103 treesize of output 48 [2025-02-08 06:44:29,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:29,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 21 [2025-02-08 06:44:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:29,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:40,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:40,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 292 treesize of output 303 [2025-02-08 06:44:40,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:40,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 256 treesize of output 275 [2025-02-08 06:44:40,898 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-08 06:44:40,898 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 22 treesize of output 1 [2025-02-08 06:44:40,999 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-08 06:44:40,999 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 2 case distinctions, treesize of input 35 treesize of output 8 [2025-02-08 06:44:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652876049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:41,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:44:41,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2025-02-08 06:44:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73146362] [2025-02-08 06:44:41,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:41,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-02-08 06:44:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:41,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-02-08 06:44:41,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=6407, Unknown=2, NotChecked=0, Total=6642 [2025-02-08 06:44:41,581 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 67 states, 64 states have (on average 1.5) internal successors, (96), 58 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:44:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:50,564 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-02-08 06:44:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:44:50,565 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.5) internal successors, (96), 58 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2025-02-08 06:44:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:50,565 INFO L225 Difference]: With dead ends: 77 [2025-02-08 06:44:50,565 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 06:44:50,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=556, Invalid=12098, Unknown=2, NotChecked=0, Total=12656 [2025-02-08 06:44:50,568 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 105 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:50,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 984 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 06:44:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 06:44:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-02-08 06:44:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 68 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-02-08 06:44:50,570 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 54 [2025-02-08 06:44:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:50,571 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-02-08 06:44:50,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.5) internal successors, (96), 58 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:44:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-02-08 06:44:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 06:44:50,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:50,572 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:50,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:44:50,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:50,776 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-08 06:44:50,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:50,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1183248674, now seen corresponding path program 3 times [2025-02-08 06:44:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:50,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633754288] [2025-02-08 06:44:50,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:44:50,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:50,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 4 equivalence classes. [2025-02-08 06:44:50,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:44:50,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 06:44:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:44:53,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:53,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633754288] [2025-02-08 06:44:53,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633754288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:53,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876619048] [2025-02-08 06:44:53,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:44:53,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:53,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:53,522 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:44:53,523 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:44:53,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 4 equivalence classes. [2025-02-08 06:44:53,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:44:53,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 06:44:53,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:54,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-02-08 06:44:54,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:54,232 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:44:54,243 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:44:54,671 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:44:54,671 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 16 treesize of output 15 [2025-02-08 06:44:54,690 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:44:54,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:44:54,702 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:44:54,864 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:44:54,870 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:44:55,149 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-08 06:44:55,150 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 27 [2025-02-08 06:44:55,154 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 0 case distinctions, treesize of input 25 treesize of output 7 [2025-02-08 06:44:55,157 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 15 treesize of output 7 [2025-02-08 06:44:55,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:55,398 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 06:44:55,398 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 2 case distinctions, treesize of input 92 treesize of output 75 [2025-02-08 06:44:55,433 INFO L349 Elim1Store]: treesize reduction 60, result has 47.8 percent of original size [2025-02-08 06:44:55,434 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 71 [2025-02-08 06:44:55,439 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 11 treesize of output 3 [2025-02-08 06:44:55,476 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-02-08 06:44:55,476 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 34 treesize of output 36 [2025-02-08 06:44:55,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2025-02-08 06:44:55,833 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-02-08 06:44:55,833 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 2 case distinctions, treesize of input 98 treesize of output 61 [2025-02-08 06:44:55,991 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:55,993 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:55,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 99 [2025-02-08 06:44:56,001 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:56,001 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 126 [2025-02-08 06:44:56,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:56,204 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 111 [2025-02-08 06:44:56,224 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:56,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:56,227 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 15 treesize of output 10