./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:43:34,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:43:35,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:43:35,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:43:35,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:43:35,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:43:35,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:43:35,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:43:35,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:43:35,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:43:35,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:43:35,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:43:35,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:43:35,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:43:35,051 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:43:35,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:43:35,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:43:35,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:43:35,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:43:35,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:35,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:43:35,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:43:35,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:35,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:43:35,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:43:35,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:43:35,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:43:35,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:43:35,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:43:35,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:43:35,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:43:35,054 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-memcleanup) ) 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2025-01-09 21:43:35,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:43:35,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:43:35,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:43:35,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:43:35,238 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:43:35,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2025-01-09 21:43:36,308 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86161012e/8e836d19cc1b430cb0077f4d5bb43bfc/FLAGc4af952ab [2025-01-09 21:43:36,529 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:43:36,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2025-01-09 21:43:36,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86161012e/8e836d19cc1b430cb0077f4d5bb43bfc/FLAGc4af952ab [2025-01-09 21:43:36,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86161012e/8e836d19cc1b430cb0077f4d5bb43bfc [2025-01-09 21:43:36,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:43:36,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:43:36,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:43:36,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:43:36,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:43:36,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:36" (1/1) ... [2025-01-09 21:43:36,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5492d126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:36, skipping insertion in model container [2025-01-09 21:43:36,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:36" (1/1) ... [2025-01-09 21:43:36,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:43:37,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:43:37,127 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:43:37,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:43:37,184 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:43:37,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37 WrapperNode [2025-01-09 21:43:37,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:43:37,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:43:37,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:43:37,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:43:37,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,220 INFO L138 Inliner]: procedures = 129, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 163 [2025-01-09 21:43:37,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:43:37,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:43:37,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:43:37,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:43:37,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,239 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2025-01-09 21:43:37,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:43:37,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:43:37,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:43:37,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:43:37,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (1/1) ... [2025-01-09 21:43:37,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:37,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:43:37,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:43:37,305 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 21:43:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2025-01-09 21:43:37,306 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 21:43:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 21:43:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 21:43:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:43:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:43:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 21:43:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:43:37,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:43:37,384 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:43:37,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:43:37,398 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 21:43:37,603 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-01-09 21:43:37,604 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:43:37,610 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:43:37,610 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:43:37,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:37 BoogieIcfgContainer [2025-01-09 21:43:37,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:43:37,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:43:37,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:43:37,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:43:37,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:43:36" (1/3) ... [2025-01-09 21:43:37,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ea4d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:37, skipping insertion in model container [2025-01-09 21:43:37,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:37" (2/3) ... [2025-01-09 21:43:37,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ea4d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:37, skipping insertion in model container [2025-01-09 21:43:37,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:37" (3/3) ... [2025-01-09 21:43:37,618 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2025-01-09 21:43:37,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:43:37,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_of_sll_nondet_append-2.i that has 3 procedures, 53 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-01-09 21:43:37,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:43:37,660 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;@4e3848cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:43:37,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:43:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 44 states have (on average 1.5) internal successors, (66), 47 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:43:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 21:43:37,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:37,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:37,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:37,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:37,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1525332629, now seen corresponding path program 1 times [2025-01-09 21:43:37,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851349375] [2025-01-09 21:43:37,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:37,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:37,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 21:43:37,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 21:43:37,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:37,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:38,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:38,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851349375] [2025-01-09 21:43:38,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851349375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:38,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:38,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:43:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963627013] [2025-01-09 21:43:38,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:38,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:43:38,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:38,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:43:38,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:38,027 INFO L87 Difference]: Start difference. First operand has 52 states, 44 states have (on average 1.5) internal successors, (66), 47 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 21:43:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:38,065 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2025-01-09 21:43:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:43:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2025-01-09 21:43:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:38,071 INFO L225 Difference]: With dead ends: 58 [2025-01-09 21:43:38,071 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 21:43:38,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:38,075 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:38,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 117 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 21:43:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2025-01-09 21:43:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 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-01-09 21:43:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2025-01-09 21:43:38,106 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2025-01-09 21:43:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:38,106 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2025-01-09 21:43:38,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 21:43:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2025-01-09 21:43:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 21:43:38,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:38,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:38,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:43:38,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:38,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1642602923, now seen corresponding path program 1 times [2025-01-09 21:43:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357427969] [2025-01-09 21:43:38,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:38,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:43:38,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:43:38,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:38,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:38,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357427969] [2025-01-09 21:43:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357427969] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:38,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293442508] [2025-01-09 21:43:38,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:38,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:38,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:38,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:38,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:43:38,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:43:38,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:43:38,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:38,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:38,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 21:43:38,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:38,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293442508] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:38,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:38,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 21:43:38,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965593954] [2025-01-09 21:43:38,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:38,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:43:38,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:38,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:43:38,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:43:38,599 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 21:43:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:38,736 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2025-01-09 21:43:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:43:38,737 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-01-09 21:43:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:38,738 INFO L225 Difference]: With dead ends: 87 [2025-01-09 21:43:38,738 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 21:43:38,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:43:38,739 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 72 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:38,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 378 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 21:43:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2025-01-09 21:43:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 71 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 21:43:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2025-01-09 21:43:38,745 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 23 [2025-01-09 21:43:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:38,745 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2025-01-09 21:43:38,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 21:43:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2025-01-09 21:43:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 21:43:38,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:38,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:38,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:43:38,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:38,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:38,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1760747750, now seen corresponding path program 1 times [2025-01-09 21:43:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:38,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90110455] [2025-01-09 21:43:38,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:38,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:43:38,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:43:38,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:38,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:43:39,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90110455] [2025-01-09 21:43:39,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90110455] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456961664] [2025-01-09 21:43:39,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:39,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:39,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:39,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:43:39,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:43:39,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:43:39,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:39,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:39,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 21:43:39,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:39,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:39,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456961664] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:39,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:39,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-01-09 21:43:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929417712] [2025-01-09 21:43:39,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:39,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 21:43:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:39,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 21:43:39,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 21:43:39,483 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:43:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:39,577 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2025-01-09 21:43:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:43:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-01-09 21:43:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:39,583 INFO L225 Difference]: With dead ends: 93 [2025-01-09 21:43:39,583 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 21:43:39,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 21:43:39,583 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:39,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 398 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 21:43:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-01-09 21:43:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.35) internal successors, (108), 83 states have internal predecessors, (108), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 21:43:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2025-01-09 21:43:39,595 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 36 [2025-01-09 21:43:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:39,596 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2025-01-09 21:43:39,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:43:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2025-01-09 21:43:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 21:43:39,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:39,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:39,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:43:39,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:39,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:39,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash -774229835, now seen corresponding path program 2 times [2025-01-09 21:43:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:39,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979367249] [2025-01-09 21:43:39,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:43:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:39,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 21:43:39,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 39 statements. [2025-01-09 21:43:39,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:43:39,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 21:43:39,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:39,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979367249] [2025-01-09 21:43:39,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979367249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:39,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:39,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:43:39,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621275609] [2025-01-09 21:43:39,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:39,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:43:39,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:39,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:43:39,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:43:39,964 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 21:43:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:40,084 INFO L93 Difference]: Finished difference Result 188 states and 270 transitions. [2025-01-09 21:43:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:43:40,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-01-09 21:43:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:40,086 INFO L225 Difference]: With dead ends: 188 [2025-01-09 21:43:40,086 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 21:43:40,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:43:40,087 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 82 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:40,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 409 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 21:43:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 167. [2025-01-09 21:43:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.342281879194631) internal successors, (200), 154 states have internal predecessors, (200), 10 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2025-01-09 21:43:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2025-01-09 21:43:40,096 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 39 [2025-01-09 21:43:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:40,096 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2025-01-09 21:43:40,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 21:43:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2025-01-09 21:43:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 21:43:40,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:40,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:40,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:43:40,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:40,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1730280180, now seen corresponding path program 1 times [2025-01-09 21:43:40,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:40,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981899596] [2025-01-09 21:43:40,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:40,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:40,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:43:40,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:43:40,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:40,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 21:43:40,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:40,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981899596] [2025-01-09 21:43:40,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981899596] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701822328] [2025-01-09 21:43:40,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:40,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:40,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:40,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:40,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:43:40,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:43:40,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:43:40,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:40,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:40,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 21:43:40,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:40,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:40,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701822328] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:40,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:40,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-01-09 21:43:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128883279] [2025-01-09 21:43:40,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:40,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:43:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:40,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:43:40,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:43:40,537 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 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-01-09 21:43:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:40,661 INFO L93 Difference]: Finished difference Result 246 states and 378 transitions. [2025-01-09 21:43:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:43:40,662 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 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 40 [2025-01-09 21:43:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:40,664 INFO L225 Difference]: With dead ends: 246 [2025-01-09 21:43:40,664 INFO L226 Difference]: Without dead ends: 246 [2025-01-09 21:43:40,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 21:43:40,664 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 55 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:40,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 472 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-09 21:43:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 173. [2025-01-09 21:43:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 155 states have (on average 1.3419354838709678) internal successors, (208), 160 states have internal predecessors, (208), 10 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2025-01-09 21:43:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 251 transitions. [2025-01-09 21:43:40,675 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 251 transitions. Word has length 40 [2025-01-09 21:43:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:40,676 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 251 transitions. [2025-01-09 21:43:40,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 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-01-09 21:43:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 251 transitions. [2025-01-09 21:43:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 21:43:40,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:40,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:40,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:43:40,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:40,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:40,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1507642825, now seen corresponding path program 1 times [2025-01-09 21:43:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:40,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043550522] [2025-01-09 21:43:40,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:40,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:40,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:43:40,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:43:40,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:40,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 21:43:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043550522] [2025-01-09 21:43:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043550522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:41,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:41,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:43:41,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891751578] [2025-01-09 21:43:41,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:41,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:43:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:41,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:43:41,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:41,105 INFO L87 Difference]: Start difference. First operand 173 states and 251 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 21:43:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:41,212 INFO L93 Difference]: Finished difference Result 330 states and 472 transitions. [2025-01-09 21:43:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:43:41,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-01-09 21:43:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:41,214 INFO L225 Difference]: With dead ends: 330 [2025-01-09 21:43:41,214 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 21:43:41,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:43:41,215 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 77 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:41,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 405 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 21:43:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 259. [2025-01-09 21:43:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 229 states have (on average 1.3100436681222707) internal successors, (300), 241 states have internal predecessors, (300), 19 states have call successors, (19), 4 states have call predecessors, (19), 9 states have return successors, (60), 13 states have call predecessors, (60), 19 states have call successors, (60) [2025-01-09 21:43:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 379 transitions. [2025-01-09 21:43:41,242 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 379 transitions. Word has length 45 [2025-01-09 21:43:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:41,243 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 379 transitions. [2025-01-09 21:43:41,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 21:43:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 379 transitions. [2025-01-09 21:43:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 21:43:41,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:41,246 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:41,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:43:41,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:41,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash 919159633, now seen corresponding path program 1 times [2025-01-09 21:43:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:41,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402841371] [2025-01-09 21:43:41,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:41,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:43:41,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:43:41,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:41,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 21:43:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402841371] [2025-01-09 21:43:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402841371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:41,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:41,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:43:41,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444240023] [2025-01-09 21:43:41,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:41,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 21:43:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:41,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 21:43:41,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:43:41,754 INFO L87 Difference]: Start difference. First operand 259 states and 379 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 21:43:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:42,002 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2025-01-09 21:43:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:43:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-09 21:43:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:42,004 INFO L225 Difference]: With dead ends: 325 [2025-01-09 21:43:42,004 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 21:43:42,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-01-09 21:43:42,004 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 76 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:42,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 500 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:43:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 21:43:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 273. [2025-01-09 21:43:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 243 states have (on average 1.3127572016460904) internal successors, (319), 254 states have internal predecessors, (319), 19 states have call successors, (19), 4 states have call predecessors, (19), 9 states have return successors, (60), 14 states have call predecessors, (60), 19 states have call successors, (60) [2025-01-09 21:43:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 398 transitions. [2025-01-09 21:43:42,027 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 398 transitions. Word has length 49 [2025-01-09 21:43:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:42,027 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 398 transitions. [2025-01-09 21:43:42,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 21:43:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 398 transitions. [2025-01-09 21:43:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 21:43:42,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:42,029 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:43:42,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:42,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:42,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1732568330, now seen corresponding path program 1 times [2025-01-09 21:43:42,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:42,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382318748] [2025-01-09 21:43:42,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:42,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:42,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:43:42,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:43:42,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:42,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 21:43:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382318748] [2025-01-09 21:43:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382318748] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309033535] [2025-01-09 21:43:42,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:42,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:42,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:42,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:43:43,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:43:43,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:43:43,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:43,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:43,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-01-09 21:43:43,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:43,135 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-01-09 21:43:43,217 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:43:43,218 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-01-09 21:43:43,253 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:43:43,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 21:43:43,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:43:43,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:43:43,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 21:43:43,497 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 14 treesize of output 15 [2025-01-09 21:43:43,508 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 47 treesize of output 20 [2025-01-09 21:43:43,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:43,566 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 1 case distinctions, treesize of input 30 treesize of output 14 [2025-01-09 21:43:43,577 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-01-09 21:43:43,577 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 48 treesize of output 30 [2025-01-09 21:43:43,724 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 21:43:43,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 21:43:43,737 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 21:43:43,737 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 23 treesize of output 15 [2025-01-09 21:43:43,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:43,834 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 151 treesize of output 103 [2025-01-09 21:43:43,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:43,842 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 99 treesize of output 99 [2025-01-09 21:43:44,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 21:43:44,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:44,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2025-01-09 21:43:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 21:43:44,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:44,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:44,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 58259 treesize of output 53664 [2025-01-09 21:43:45,052 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 8288 treesize of output 8028 [2025-01-09 21:43:45,172 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-01-09 21:43:45,173 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 3 case distinctions, treesize of input 908 treesize of output 894 [2025-01-09 21:44:05,693 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 492 treesize of output 462 [2025-01-09 21:44:05,910 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 492 treesize of output 462 [2025-01-09 21:44:31,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:44:31,014 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:31,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:44:31,018 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 354 treesize of output 346 [2025-01-09 21:44:31,096 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:31,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:44:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3695 treesize of output 2806 [2025-01-09 21:44:31,848 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:31,849 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:31,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:44:31,873 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 3695 treesize of output 2806 [2025-01-09 21:44:32,737 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:32,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:44:32,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3695 treesize of output 2806 [2025-01-09 21:44:33,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:44:33,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:44:33,729 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:33,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:44:33,751 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 3695 treesize of output 2806 [2025-01-09 21:44:34,428 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:34,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:44:34,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3695 treesize of output 2806 [2025-01-09 21:44:35,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:44:35,915 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:35,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:44:35,919 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 354 treesize of output 346 [2025-01-09 21:44:35,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:44:35,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:44:36,022 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:36,023 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:36,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:44:36,048 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 3695 treesize of output 2806 [2025-01-09 21:44:36,659 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:36,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:44:36,683 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 3695 treesize of output 2806 [2025-01-09 21:44:37,524 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:44:37,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:44:37,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3695 treesize of output 2806 [2025-01-09 21:45:12,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:45:12,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2025-01-09 21:45:12,715 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:45:12,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2025-01-09 21:45:12,741 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:45:12,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2025-01-09 21:45:12,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:45:12,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2025-01-09 21:45:12,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:45:12,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2025-01-09 21:45:12,835 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:45:12,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2025-01-09 21:45:12,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:45:12,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2025-01-09 21:45:12,875 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:45:12,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48