./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:39:17,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:39:17,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:39:17,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:39:17,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:39:17,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:39:17,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:39:17,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:39:17,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:39:17,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:39:17,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:39:17,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:39:17,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:39:17,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:39:17,935 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:39:17,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:39:17,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:39:17,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:39:17,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:39:17,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:39:17,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:39:17,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:39:17,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:39:17,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:39:17,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:39:17,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:39:17,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:39:17,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:39:17,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:39:17,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:39:17,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:39:17,938 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2025-02-06 10:39:18,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:39:18,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:39:18,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:39:18,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:39:18,163 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:39:18,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2025-02-06 10:39:19,314 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a053d9b98/e72011a55f864233be6fd9928dd72745/FLAG0c08b8174 [2025-02-06 10:39:19,582 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:39:19,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2025-02-06 10:39:19,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a053d9b98/e72011a55f864233be6fd9928dd72745/FLAG0c08b8174 [2025-02-06 10:39:19,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a053d9b98/e72011a55f864233be6fd9928dd72745 [2025-02-06 10:39:19,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:39:19,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:39:19,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:39:19,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:39:19,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:39:19,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:39:19" (1/1) ... [2025-02-06 10:39:19,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12021fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:19, skipping insertion in model container [2025-02-06 10:39:19,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:39:19" (1/1) ... [2025-02-06 10:39:19,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:39:20,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:39:20,089 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:39:20,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:39:20,146 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:39:20,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20 WrapperNode [2025-02-06 10:39:20,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:39:20,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:39:20,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:39:20,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:39:20,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,184 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2025-02-06 10:39:20,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:39:20,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:39:20,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:39:20,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:39:20,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,211 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 13, 9]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2025-02-06 10:39:20,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:39:20,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:39:20,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:39:20,222 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:39:20,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (1/1) ... [2025-02-06 10:39:20,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:39:20,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:20,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:39:20,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-06 10:39:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:39:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:39:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:39:20,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:39:20,368 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:39:20,370 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:39:20,640 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-06 10:39:20,663 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-06 10:39:20,680 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-06 10:39:20,680 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:39:20,693 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:39:20,695 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:39:20,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:39:20 BoogieIcfgContainer [2025-02-06 10:39:20,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:39:20,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:39:20,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:39:20,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:39:20,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:39:19" (1/3) ... [2025-02-06 10:39:20,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ec7a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:39:20, skipping insertion in model container [2025-02-06 10:39:20,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:39:20" (2/3) ... [2025-02-06 10:39:20,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ec7a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:39:20, skipping insertion in model container [2025-02-06 10:39:20,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:39:20" (3/3) ... [2025-02-06 10:39:20,707 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2025-02-06 10:39:20,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:39:20,723 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_equal.i that has 2 procedures, 121 locations, 1 initial locations, 4 loop locations, and 50 error locations. [2025-02-06 10:39:20,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:39:20,773 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;@13d952f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:39:20,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-06 10:39:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 116 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:39:20,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:20,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:39:20,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:20,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash 230986644, now seen corresponding path program 1 times [2025-02-06 10:39:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014619223] [2025-02-06 10:39:20,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:20,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:39:20,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:39:20,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:20,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:20,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:20,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014619223] [2025-02-06 10:39:20,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014619223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:20,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:20,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:39:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100941319] [2025-02-06 10:39:20,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:20,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:39:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:20,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:39:20,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:39:20,995 INFO L87 Difference]: Start difference. First operand has 121 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 116 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:39:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:21,104 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2025-02-06 10:39:21,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:39:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:39:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:21,111 INFO L225 Difference]: With dead ends: 118 [2025-02-06 10:39:21,111 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 10:39:21,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:39:21,117 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:21,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 192 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:39:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 10:39:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-02-06 10:39:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2025-02-06 10:39:21,154 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 6 [2025-02-06 10:39:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:21,154 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2025-02-06 10:39:21,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:39:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2025-02-06 10:39:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:39:21,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:21,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:39:21,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:39:21,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash 230986645, now seen corresponding path program 1 times [2025-02-06 10:39:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:21,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641059340] [2025-02-06 10:39:21,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:21,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:39:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:39:21,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:21,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:21,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641059340] [2025-02-06 10:39:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641059340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:21,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:21,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:39:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498730093] [2025-02-06 10:39:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:21,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:39:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:21,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:39:21,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:39:21,255 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:39:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:21,312 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2025-02-06 10:39:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:39:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:39:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:21,313 INFO L225 Difference]: With dead ends: 113 [2025-02-06 10:39:21,313 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 10:39:21,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:39:21,314 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:21,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 193 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:39:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 10:39:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-06 10:39:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-02-06 10:39:21,320 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 6 [2025-02-06 10:39:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:21,320 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-02-06 10:39:21,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:39:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-02-06 10:39:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:39:21,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:21,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:21,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:39:21,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:21,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:21,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2026267786, now seen corresponding path program 1 times [2025-02-06 10:39:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:21,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818345198] [2025-02-06 10:39:21,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:21,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:39:21,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:39:21,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:21,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818345198] [2025-02-06 10:39:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818345198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:21,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:39:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007607778] [2025-02-06 10:39:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:21,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:39:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:21,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:39:21,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:39:21,404 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:39:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:21,418 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2025-02-06 10:39:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:39:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-02-06 10:39:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:21,419 INFO L225 Difference]: With dead ends: 120 [2025-02-06 10:39:21,419 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 10:39:21,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:39:21,420 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:21,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:39:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 10:39:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2025-02-06 10:39:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.8125) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2025-02-06 10:39:21,426 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 13 [2025-02-06 10:39:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:21,426 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2025-02-06 10:39:21,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:39:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2025-02-06 10:39:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:39:21,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:21,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:21,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:39:21,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:21,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1400837682, now seen corresponding path program 1 times [2025-02-06 10:39:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310965881] [2025-02-06 10:39:21,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:39:21,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:39:21,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:21,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:39:21,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:21,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310965881] [2025-02-06 10:39:21,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310965881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:21,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:39:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166094883] [2025-02-06 10:39:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:21,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:39:21,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:21,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:39:21,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:21,553 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:21,705 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2025-02-06 10:39:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:39:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-06 10:39:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:21,707 INFO L225 Difference]: With dead ends: 113 [2025-02-06 10:39:21,708 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 10:39:21,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:21,709 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:21,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 365 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:39:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 10:39:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-06 10:39:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.796875) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-02-06 10:39:21,716 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 22 [2025-02-06 10:39:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:21,716 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-02-06 10:39:21,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-02-06 10:39:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:39:21,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:21,717 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:21,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:39:21,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:21,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:21,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1400837681, now seen corresponding path program 1 times [2025-02-06 10:39:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:21,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753561676] [2025-02-06 10:39:21,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:21,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:21,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:39:21,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:39:21,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:21,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:21,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:21,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753561676] [2025-02-06 10:39:21,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753561676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:21,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:21,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:39:21,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023775911] [2025-02-06 10:39:21,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:21,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:39:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:21,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:39:21,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:21,924 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:22,049 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2025-02-06 10:39:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:39:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-06 10:39:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:22,050 INFO L225 Difference]: With dead ends: 112 [2025-02-06 10:39:22,050 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 10:39:22,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:22,051 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:22,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 389 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:39:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 10:39:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 10:39:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 64 states have (on average 1.78125) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-02-06 10:39:22,055 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 22 [2025-02-06 10:39:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:22,055 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-02-06 10:39:22,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-02-06 10:39:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:39:22,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:22,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:22,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:39:22,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:22,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1841912410, now seen corresponding path program 1 times [2025-02-06 10:39:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016261255] [2025-02-06 10:39:22,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:22,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:39:22,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:39:22,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:22,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016261255] [2025-02-06 10:39:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016261255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874188491] [2025-02-06 10:39:22,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:22,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:22,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:22,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:22,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:39:22,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:39:22,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:39:22,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:22,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:22,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:39:22,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:22,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:39:22,466 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:39:22,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:39:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:22,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874188491] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:22,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:22,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-02-06 10:39:22,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498579077] [2025-02-06 10:39:22,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:22,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:39:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:22,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:39:22,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:39:22,813 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:39:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:23,201 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2025-02-06 10:39:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:39:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-02-06 10:39:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:23,202 INFO L225 Difference]: With dead ends: 111 [2025-02-06 10:39:23,202 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 10:39:23,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:39:23,203 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:23,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 888 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:39:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 10:39:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-06 10:39:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.765625) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2025-02-06 10:39:23,207 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 25 [2025-02-06 10:39:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:23,207 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2025-02-06 10:39:23,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:39:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2025-02-06 10:39:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:39:23,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:23,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:23,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:39:23,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:23,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:23,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1841912411, now seen corresponding path program 1 times [2025-02-06 10:39:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277475403] [2025-02-06 10:39:23,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:23,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:39:23,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:39:23,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:23,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:23,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277475403] [2025-02-06 10:39:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277475403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896880984] [2025-02-06 10:39:23,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:23,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:23,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:23,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:23,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:39:23,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:39:23,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:39:23,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:23,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:23,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 10:39:23,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:23,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:39:23,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:39:23,978 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:23,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:39:23,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:24,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:24,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896880984] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:24,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:39:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2025-02-06 10:39:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055476736] [2025-02-06 10:39:24,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:24,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:39:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:24,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:39:24,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:39:24,175 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:39:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:24,645 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2025-02-06 10:39:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:39:24,645 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-02-06 10:39:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:24,646 INFO L225 Difference]: With dead ends: 112 [2025-02-06 10:39:24,646 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 10:39:24,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:39:24,647 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:24,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 944 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:39:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 10:39:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-02-06 10:39:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.75) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2025-02-06 10:39:24,657 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 25 [2025-02-06 10:39:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:24,657 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2025-02-06 10:39:24,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:39:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2025-02-06 10:39:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:39:24,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:24,657 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 10:39:24,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:24,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:24,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:24,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1612330962, now seen corresponding path program 1 times [2025-02-06 10:39:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:24,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677738069] [2025-02-06 10:39:24,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:24,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:39:24,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:39:24,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:24,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:39:25,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677738069] [2025-02-06 10:39:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677738069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456453887] [2025-02-06 10:39:25,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:25,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:25,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:25,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:25,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:39:25,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:39:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:39:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:25,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 10:39:25,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:25,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:39:25,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:25,395 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-02-06 10:39:25,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:25,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:25,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:25,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:25,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:25,509 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-02-06 10:39:25,528 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:39:25,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:39:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2025-02-06 10:39:25,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:25,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456453887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:25,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:39:25,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2025-02-06 10:39:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710000737] [2025-02-06 10:39:25,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:25,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:39:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:25,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:39:25,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2025-02-06 10:39:25,695 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 10:39:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:26,029 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2025-02-06 10:39:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:39:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2025-02-06 10:39:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:26,030 INFO L225 Difference]: With dead ends: 120 [2025-02-06 10:39:26,030 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 10:39:26,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2025-02-06 10:39:26,031 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 109 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:26,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 404 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 474 Invalid, 0 Unknown, 244 Unchecked, 0.3s Time] [2025-02-06 10:39:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 10:39:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2025-02-06 10:39:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 64 states have (on average 1.625) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2025-02-06 10:39:26,035 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 37 [2025-02-06 10:39:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:26,035 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2025-02-06 10:39:26,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 10:39:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2025-02-06 10:39:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:39:26,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:26,036 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 10:39:26,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:26,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:26,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:26,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1612330961, now seen corresponding path program 1 times [2025-02-06 10:39:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149747541] [2025-02-06 10:39:26,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:26,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:39:26,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:39:26,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:26,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149747541] [2025-02-06 10:39:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149747541] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705756973] [2025-02-06 10:39:26,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:26,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:26,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:39:26,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:39:26,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:39:26,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:26,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:26,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:39:26,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:26,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:39:26,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:26,819 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-06 10:39:26,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:26,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:26,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:26,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:26,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:27,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:27,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:39:27,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:39:27,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705756973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:27,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:39:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2025-02-06 10:39:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916489784] [2025-02-06 10:39:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:27,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:39:27,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:27,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:39:27,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2025-02-06 10:39:27,022 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:39:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:27,140 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-02-06 10:39:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:39:27,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-02-06 10:39:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:27,141 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:39:27,141 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:39:27,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2025-02-06 10:39:27,141 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 23 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:27,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 285 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 132 Unchecked, 0.1s Time] [2025-02-06 10:39:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:39:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 10:39:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.546875) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2025-02-06 10:39:27,145 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 37 [2025-02-06 10:39:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:27,145 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2025-02-06 10:39:27,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:39:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2025-02-06 10:39:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:39:27,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:27,146 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 10:39:27,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:39:27,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 10:39:27,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:27,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1033140683, now seen corresponding path program 1 times [2025-02-06 10:39:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535563994] [2025-02-06 10:39:27,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:27,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:39:27,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:39:27,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:27,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:39:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535563994] [2025-02-06 10:39:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535563994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:27,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:27,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:39:27,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453758197] [2025-02-06 10:39:27,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:27,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:39:27,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:27,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:39:27,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:27,436 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:39:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:27,527 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2025-02-06 10:39:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:39:27,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-02-06 10:39:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:27,528 INFO L225 Difference]: With dead ends: 95 [2025-02-06 10:39:27,529 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 10:39:27,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:27,530 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 20 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:27,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 295 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:39:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 10:39:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 10:39:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.515625) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2025-02-06 10:39:27,536 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 39 [2025-02-06 10:39:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:27,537 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2025-02-06 10:39:27,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:39:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2025-02-06 10:39:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:39:27,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:27,538 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 10:39:27,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:39:27,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:27,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1033140684, now seen corresponding path program 1 times [2025-02-06 10:39:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:27,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635243678] [2025-02-06 10:39:27,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:27,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:27,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:39:27,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:39:27,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:27,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:27,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:27,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635243678] [2025-02-06 10:39:27,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635243678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:27,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889345322] [2025-02-06 10:39:27,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:27,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:27,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:27,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:27,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:39:27,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:39:27,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:39:27,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:27,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:27,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:39:27,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:39:27,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:39:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889345322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:27,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:39:27,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-02-06 10:39:27,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653539971] [2025-02-06 10:39:27,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:27,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:39:27,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:27,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:39:27,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:39:27,851 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:39:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:27,943 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2025-02-06 10:39:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:39:27,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-02-06 10:39:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:27,945 INFO L225 Difference]: With dead ends: 93 [2025-02-06 10:39:27,945 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 10:39:27,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:39:27,945 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 21 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:27,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 328 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:39:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 10:39:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 10:39:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.484375) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2025-02-06 10:39:27,947 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 39 [2025-02-06 10:39:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:27,950 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2025-02-06 10:39:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:39:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2025-02-06 10:39:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:39:27,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:27,952 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 10:39:27,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:39:28,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 10:39:28,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:28,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 586155636, now seen corresponding path program 1 times [2025-02-06 10:39:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:28,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394481603] [2025-02-06 10:39:28,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:28,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:39:28,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:39:28,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:28,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:28,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394481603] [2025-02-06 10:39:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394481603] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629893058] [2025-02-06 10:39:28,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:28,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:28,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:39:28,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:39:28,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:39:28,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:28,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:28,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 10:39:28,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:28,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:39:28,677 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-06 10:39:28,707 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-06 10:39:28,707 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 23 treesize of output 24 [2025-02-06 10:39:28,721 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 17 treesize of output 9 [2025-02-06 10:39:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:39:28,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:39:28,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629893058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:28,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:39:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2025-02-06 10:39:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980297951] [2025-02-06 10:39:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:28,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:39:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:28,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:39:28,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-02-06 10:39:28,727 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:39:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:28,864 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2025-02-06 10:39:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:39:28,865 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-02-06 10:39:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:28,866 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:39:28,866 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:39:28,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-02-06 10:39:28,867 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 25 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:28,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 332 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 170 Unchecked, 0.1s Time] [2025-02-06 10:39:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:39:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-02-06 10:39:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 88 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2025-02-06 10:39:28,870 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 42 [2025-02-06 10:39:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:28,871 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2025-02-06 10:39:28,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:39:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2025-02-06 10:39:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:39:28,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:28,871 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 10:39:28,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:39:29,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 10:39:29,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:29,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash 586155637, now seen corresponding path program 1 times [2025-02-06 10:39:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881817822] [2025-02-06 10:39:29,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:29,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:39:29,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:39:29,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:29,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:29,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:29,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881817822] [2025-02-06 10:39:29,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881817822] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:29,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213269740] [2025-02-06 10:39:29,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:29,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:29,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:29,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:29,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:39:29,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:39:29,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:39:29,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:29,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:29,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 10:39:29,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:29,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:39:29,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:39:29,922 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-06 10:39:29,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:29,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 10:39:29,971 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:39:29,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:39:30,027 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 17 treesize of output 9 [2025-02-06 10:39:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-06 10:39:30,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213269740] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:30,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:39:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2025-02-06 10:39:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137542505] [2025-02-06 10:39:30,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:30,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:39:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:30,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:39:30,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=966, Unknown=1, NotChecked=62, Total=1122 [2025-02-06 10:39:30,264 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 30 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:39:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:31,106 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2025-02-06 10:39:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:39:31,107 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2025-02-06 10:39:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:31,107 INFO L225 Difference]: With dead ends: 105 [2025-02-06 10:39:31,108 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 10:39:31,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1807, Unknown=1, NotChecked=86, Total=2070 [2025-02-06 10:39:31,109 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 109 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:31,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1070 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1099 Invalid, 0 Unknown, 108 Unchecked, 0.5s Time] [2025-02-06 10:39:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 10:39:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-02-06 10:39:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.394736842105263) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-02-06 10:39:31,112 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 42 [2025-02-06 10:39:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:31,112 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-02-06 10:39:31,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:39:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-02-06 10:39:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:39:31,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:31,114 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 10:39:31,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:39:31,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:31,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:31,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash 558478838, now seen corresponding path program 1 times [2025-02-06 10:39:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:31,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798824675] [2025-02-06 10:39:31,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:31,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:39:31,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:39:31,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:31,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798824675] [2025-02-06 10:39:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798824675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74158350] [2025-02-06 10:39:31,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:31,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:31,487 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:31,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:39:31,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:39:31,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:39:31,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:31,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:31,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 10:39:31,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:31,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:39:31,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:31,654 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-06 10:39:31,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:31,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:31,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:31,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:31,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:31,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:31,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:31,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:39:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:39:31,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:39:31,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74158350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:31,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:39:31,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-02-06 10:39:31,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168882267] [2025-02-06 10:39:31,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:31,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:39:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:31,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:39:31,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=133, Unknown=1, NotChecked=22, Total=182 [2025-02-06 10:39:31,852 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:39:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:31,913 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2025-02-06 10:39:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:39:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-02-06 10:39:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:31,914 INFO L225 Difference]: With dead ends: 101 [2025-02-06 10:39:31,914 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 10:39:31,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=133, Unknown=1, NotChecked=22, Total=182 [2025-02-06 10:39:31,914 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:31,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 185 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 113 Unchecked, 0.1s Time] [2025-02-06 10:39:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 10:39:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 10:39:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.355263157894737) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-02-06 10:39:31,918 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 42 [2025-02-06 10:39:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:31,918 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-02-06 10:39:31,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:39:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-02-06 10:39:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:39:31,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:31,919 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-02-06 10:39:31,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:32,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:32,121 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:32,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:32,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1060241914, now seen corresponding path program 1 times [2025-02-06 10:39:32,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:32,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254605371] [2025-02-06 10:39:32,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:32,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:39:32,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:39:32,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:32,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:32,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:32,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254605371] [2025-02-06 10:39:32,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254605371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:32,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788371462] [2025-02-06 10:39:32,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:32,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:32,268 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:32,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:39:32,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:39:32,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:39:32,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:32,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:32,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 10:39:32,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:32,586 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:32,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:32,589 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 16 treesize of output 11 [2025-02-06 10:39:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:32,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:32,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:32,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-02-06 10:39:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:39:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788371462] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:32,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 23 [2025-02-06 10:39:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294895903] [2025-02-06 10:39:32,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:32,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:39:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:32,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:39:32,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:39:32,801 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 10:39:36,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:39:40,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:39:44,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:39:48,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:39:53,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:39:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:53,117 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2025-02-06 10:39:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:39:53,118 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2025-02-06 10:39:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:53,122 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:39:53,122 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 10:39:53,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:39:53,123 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 128 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:53,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1169 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-02-06 10:39:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 10:39:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2025-02-06 10:39:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:39:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2025-02-06 10:39:53,128 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 45 [2025-02-06 10:39:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:53,128 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2025-02-06 10:39:53,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 10:39:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2025-02-06 10:39:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:39:53,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:53,130 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:53,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:53,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:53,335 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:53,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash -221414770, now seen corresponding path program 1 times [2025-02-06 10:39:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:53,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696403577] [2025-02-06 10:39:53,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:53,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:39:53,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:39:53,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:53,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:54,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696403577] [2025-02-06 10:39:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696403577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347129965] [2025-02-06 10:39:54,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:54,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:54,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:54,058 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:54,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:39:54,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:39:54,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:39:54,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:54,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:54,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-06 10:39:54,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:54,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:39:54,398 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:39:54,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:39:54,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:39:54,579 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:54,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:39:54,691 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 30 treesize of output 14 [2025-02-06 10:39:54,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:39:54,830 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2025-02-06 10:39:54,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:54,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-02-06 10:39:54,876 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-02-06 10:39:54,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2025-02-06 10:39:54,959 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 7 treesize of output 3 [2025-02-06 10:39:55,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2025-02-06 10:39:55,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:39:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:39:55,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347129965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:55,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:39:55,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2025-02-06 10:39:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240046445] [2025-02-06 10:39:55,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 10:39:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:55,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 10:39:55,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2013, Unknown=1, NotChecked=90, Total=2256 [2025-02-06 10:39:55,265 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 47 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 40 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:39:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:56,187 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2025-02-06 10:39:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:39:56,187 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 40 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-02-06 10:39:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:56,188 INFO L225 Difference]: With dead ends: 143 [2025-02-06 10:39:56,188 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 10:39:56,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=264, Invalid=3161, Unknown=1, NotChecked=114, Total=3540 [2025-02-06 10:39:56,189 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 144 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:56,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1283 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1536 Invalid, 0 Unknown, 140 Unchecked, 0.6s Time] [2025-02-06 10:39:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 10:39:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2025-02-06 10:39:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.29) internal successors, (129), 119 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:39:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-02-06 10:39:56,193 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 48 [2025-02-06 10:39:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:56,193 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-02-06 10:39:56,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 40 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:39:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-02-06 10:39:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:39:56,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:56,194 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:56,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:56,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 10:39:56,395 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:39:56,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash -221414769, now seen corresponding path program 1 times [2025-02-06 10:39:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694717088] [2025-02-06 10:39:56,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:56,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:56,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:39:56,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:39:56,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:56,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:57,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:57,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694717088] [2025-02-06 10:39:57,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694717088] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:57,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944550014] [2025-02-06 10:39:57,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:57,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:57,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:57,333 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:39:57,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:39:57,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:39:57,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:39:57,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:57,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:57,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-02-06 10:39:57,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:57,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:39:57,793 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:39:57,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:39:57,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:39:57,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:39:58,063 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:58,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-02-06 10:39:58,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:39:58,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-02-06 10:39:58,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:39:58,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:58,278 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 11 treesize of output 3 [2025-02-06 10:39:58,459 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2025-02-06 10:39:58,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:58,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-02-06 10:39:58,505 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-06 10:39:58,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-06 10:39:58,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-06 10:39:58,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:39:58,601 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 48 treesize of output 28 [2025-02-06 10:39:58,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:39:58,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:39:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:39:58,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944550014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:59,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:39:59,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2025-02-06 10:39:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336038018] [2025-02-06 10:39:59,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:59,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-06 10:39:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:59,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-06 10:39:59,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3133, Unknown=1, NotChecked=112, Total=3422 [2025-02-06 10:39:59,296 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 52 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:01,399 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2025-02-06 10:40:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:40:01,399 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-02-06 10:40:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:01,400 INFO L225 Difference]: With dead ends: 147 [2025-02-06 10:40:01,400 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 10:40:01,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=371, Invalid=5638, Unknown=1, NotChecked=152, Total=6162 [2025-02-06 10:40:01,402 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 195 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:01,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1755 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2137 Invalid, 0 Unknown, 144 Unchecked, 1.1s Time] [2025-02-06 10:40:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 10:40:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2025-02-06 10:40:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 117 states have internal predecessors, (126), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2025-02-06 10:40:01,405 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 48 [2025-02-06 10:40:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:01,405 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2025-02-06 10:40:01,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2025-02-06 10:40:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:40:01,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:01,406 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:01,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:01,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 10:40:01,607 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:01,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1519497041, now seen corresponding path program 1 times [2025-02-06 10:40:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:01,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115036874] [2025-02-06 10:40:01,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:01,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:40:01,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:40:01,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:01,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:40:01,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115036874] [2025-02-06 10:40:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115036874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:01,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:01,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:40:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211462847] [2025-02-06 10:40:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:01,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:40:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:01,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:40:01,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:40:01,760 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:40:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:01,855 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2025-02-06 10:40:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:40:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2025-02-06 10:40:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:01,856 INFO L225 Difference]: With dead ends: 137 [2025-02-06 10:40:01,856 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 10:40:01,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:40:01,856 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 73 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:01,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 402 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 10:40:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2025-02-06 10:40:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.28) internal successors, (128), 118 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2025-02-06 10:40:01,861 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 53 [2025-02-06 10:40:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:01,861 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2025-02-06 10:40:01,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:40:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2025-02-06 10:40:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:40:01,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:01,862 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:01,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:40:01,862 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:01,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1519497040, now seen corresponding path program 1 times [2025-02-06 10:40:01,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:01,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559711157] [2025-02-06 10:40:01,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:01,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:01,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:40:01,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:40:01,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:01,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:40:02,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559711157] [2025-02-06 10:40:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559711157] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877951663] [2025-02-06 10:40:02,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:02,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:02,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:02,357 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:40:02,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:40:02,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:40:02,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:40:02,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:02,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:02,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:40:02,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:02,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:40:02,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:02,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:02,694 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18|) 0))) is different from true [2025-02-06 10:40:02,723 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:40:02,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:40:02,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 10:40:02,772 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 17 treesize of output 9 [2025-02-06 10:40:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-06 10:40:02,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877951663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:02,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 29 [2025-02-06 10:40:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185988264] [2025-02-06 10:40:02,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:02,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:40:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:02,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:40:02,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=955, Unknown=1, NotChecked=62, Total=1122 [2025-02-06 10:40:02,925 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 30 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:40:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:03,429 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2025-02-06 10:40:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:40:03,429 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2025-02-06 10:40:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:03,430 INFO L225 Difference]: With dead ends: 139 [2025-02-06 10:40:03,430 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 10:40:03,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=1407, Unknown=1, NotChecked=76, Total=1640 [2025-02-06 10:40:03,431 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 99 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:03,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 842 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 918 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2025-02-06 10:40:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 10:40:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2025-02-06 10:40:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 120 states have internal predecessors, (130), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2025-02-06 10:40:03,433 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 53 [2025-02-06 10:40:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:03,433 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2025-02-06 10:40:03,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:40:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2025-02-06 10:40:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:40:03,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:03,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:03,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 10:40:03,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:03,634 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1529213736, now seen corresponding path program 2 times [2025-02-06 10:40:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:03,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879398705] [2025-02-06 10:40:03,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:40:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:03,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-06 10:40:03,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:40:03,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:40:03,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:04,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879398705] [2025-02-06 10:40:04,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879398705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640260440] [2025-02-06 10:40:04,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:40:04,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:04,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:04,448 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:40:04,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:40:04,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-06 10:40:04,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:40:04,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:40:04,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:04,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-02-06 10:40:04,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:04,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:40:04,802 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:40:04,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:40:04,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:04,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:05,012 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 10:40:05,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2025-02-06 10:40:05,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:40:05,160 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:40:05,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2025-02-06 10:40:05,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:05,166 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 11 treesize of output 3 [2025-02-06 10:40:05,310 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-02-06 10:40:05,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:05,338 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-06 10:40:05,338 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 57 treesize of output 46 [2025-02-06 10:40:05,353 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-06 10:40:05,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-06 10:40:05,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:40:05,630 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 54 treesize of output 30 [2025-02-06 10:40:05,685 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 7 treesize of output 3 [2025-02-06 10:40:05,844 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:40:05,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2025-02-06 10:40:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:40:05,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:05,894 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2025-02-06 10:40:05,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2025-02-06 10:40:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640260440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:06,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 53 [2025-02-06 10:40:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217562377] [2025-02-06 10:40:06,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:06,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-06 10:40:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:06,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-06 10:40:06,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3100, Unknown=1, NotChecked=112, Total=3422 [2025-02-06 10:40:06,080 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 54 states, 50 states have (on average 1.84) internal successors, (92), 47 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:07,482 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2025-02-06 10:40:07,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:40:07,482 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.84) internal successors, (92), 47 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2025-02-06 10:40:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:07,483 INFO L225 Difference]: With dead ends: 153 [2025-02-06 10:40:07,483 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 10:40:07,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=371, Invalid=4744, Unknown=1, NotChecked=140, Total=5256 [2025-02-06 10:40:07,484 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 139 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 1907 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:07,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1751 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1907 Invalid, 0 Unknown, 147 Unchecked, 0.9s Time] [2025-02-06 10:40:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 10:40:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2025-02-06 10:40:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 128 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2025-02-06 10:40:07,487 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 54 [2025-02-06 10:40:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:07,487 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2025-02-06 10:40:07,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.84) internal successors, (92), 47 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2025-02-06 10:40:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:40:07,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:07,487 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:07,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 10:40:07,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:07,688 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:07,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1529213737, now seen corresponding path program 2 times [2025-02-06 10:40:07,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:07,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907907767] [2025-02-06 10:40:07,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:40:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:07,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-06 10:40:07,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:40:07,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:40:07,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907907767] [2025-02-06 10:40:08,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907907767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222294453] [2025-02-06 10:40:08,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:40:08,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:08,465 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:40:08,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:40:08,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-06 10:40:08,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:40:08,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:40:08,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:08,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-02-06 10:40:08,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:08,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:40:08,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:40:08,806 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:08,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:40:08,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:08,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:09,029 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 10:40:09,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2025-02-06 10:40:09,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-02-06 10:40:09,196 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:40:09,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2025-02-06 10:40:09,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:09,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-06 10:40:09,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:09,349 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_11|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-02-06 10:40:09,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:09,376 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-06 10:40:09,377 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 72 treesize of output 55 [2025-02-06 10:40:09,389 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-06 10:40:09,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-06 10:40:09,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-02-06 10:40:09,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 10:40:09,662 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 78 treesize of output 46 [2025-02-06 10:40:09,985 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:40:09,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 21 [2025-02-06 10:40:09,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:40:10,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222294453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:10,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:10,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2025-02-06 10:40:10,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077899412] [2025-02-06 10:40:10,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:10,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 10:40:10,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:10,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 10:40:10,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3713, Unknown=1, NotChecked=122, Total=4032 [2025-02-06 10:40:10,593 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 55 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 48 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:16,576 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-02-06 10:40:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:40:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 48 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2025-02-06 10:40:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:16,577 INFO L225 Difference]: With dead ends: 136 [2025-02-06 10:40:16,577 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 10:40:16,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=356, Invalid=5808, Unknown=2, NotChecked=154, Total=6320 [2025-02-06 10:40:16,579 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 96 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:16,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1959 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1978 Invalid, 0 Unknown, 127 Unchecked, 1.1s Time] [2025-02-06 10:40:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 10:40:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-02-06 10:40:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 124 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2025-02-06 10:40:16,584 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 54 [2025-02-06 10:40:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:16,584 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2025-02-06 10:40:16,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 48 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2025-02-06 10:40:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:40:16,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:16,587 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:16,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 10:40:16,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-06 10:40:16,788 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:16,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1351449568, now seen corresponding path program 1 times [2025-02-06 10:40:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:16,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041062000] [2025-02-06 10:40:16,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:16,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:40:16,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:40:16,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:16,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:17,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:17,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041062000] [2025-02-06 10:40:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041062000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:17,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269822649] [2025-02-06 10:40:17,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:17,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:17,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:17,501 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:40:17,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:40:17,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:40:17,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:40:17,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:17,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:17,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 152 conjuncts are in the unsatisfiable core [2025-02-06 10:40:17,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:17,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:40:18,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:18,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:18,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:40:18,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:40:18,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:18,297 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:40:18,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-02-06 10:40:18,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:40:18,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:18,457 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 16 treesize of output 8 [2025-02-06 10:40:18,460 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 11 treesize of output 3 [2025-02-06 10:40:18,750 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:40:18,750 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 25 treesize of output 28 [2025-02-06 10:40:18,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:40:18,771 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:40:18,771 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 20 treesize of output 23 [2025-02-06 10:40:18,793 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:40:18,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:40:19,164 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:19,164 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:19,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 10:40:19,174 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 11 treesize of output 3 [2025-02-06 10:40:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:19,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:19,701 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 12 treesize of output 8 [2025-02-06 10:40:20,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269822649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:20,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:20,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 51 [2025-02-06 10:40:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18286720] [2025-02-06 10:40:20,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:20,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-06 10:40:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:20,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-06 10:40:20,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3785, Unknown=30, NotChecked=0, Total=4032 [2025-02-06 10:40:20,087 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 51 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 43 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:21,638 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2025-02-06 10:40:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 10:40:21,640 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 43 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2025-02-06 10:40:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:21,641 INFO L225 Difference]: With dead ends: 136 [2025-02-06 10:40:21,641 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 10:40:21,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=400, Invalid=6212, Unknown=30, NotChecked=0, Total=6642 [2025-02-06 10:40:21,643 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 40 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:21,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1721 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 10:40:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 10:40:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-02-06 10:40:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 124 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2025-02-06 10:40:21,649 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 57 [2025-02-06 10:40:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:21,649 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2025-02-06 10:40:21,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 43 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2025-02-06 10:40:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 10:40:21,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:21,650 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:21,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:40:21,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:21,850 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:21,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1040396586, now seen corresponding path program 3 times [2025-02-06 10:40:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:21,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953361867] [2025-02-06 10:40:21,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:40:21,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:21,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 4 equivalence classes. [2025-02-06 10:40:21,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 60 statements. [2025-02-06 10:40:21,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:40:21,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 10:40:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953361867] [2025-02-06 10:40:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953361867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763598282] [2025-02-06 10:40:21,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:40:21,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:21,907 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:40:21,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:40:22,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 4 equivalence classes. [2025-02-06 10:40:22,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 60 statements. [2025-02-06 10:40:22,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:40:22,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:22,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:40:22,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 10:40:22,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:22,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763598282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:22,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 10:40:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457655515] [2025-02-06 10:40:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:40:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:22,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:40:22,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:22,136 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:40:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:22,150 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2025-02-06 10:40:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:40:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2025-02-06 10:40:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:22,151 INFO L225 Difference]: With dead ends: 96 [2025-02-06 10:40:22,151 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 10:40:22,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:22,152 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:22,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 10:40:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 10:40:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.25) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:40:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2025-02-06 10:40:22,154 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 60 [2025-02-06 10:40:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:22,154 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2025-02-06 10:40:22,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:40:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2025-02-06 10:40:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 10:40:22,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:22,156 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:22,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:22,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:22,357 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:22,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1957750586, now seen corresponding path program 1 times [2025-02-06 10:40:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:22,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179311651] [2025-02-06 10:40:22,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:22,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:40:22,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:40:22,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:22,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:24,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179311651] [2025-02-06 10:40:24,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179311651] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240469766] [2025-02-06 10:40:24,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:24,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:24,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:24,207 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:40:24,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:40:24,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:40:24,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:40:24,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:24,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:24,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-02-06 10:40:24,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:24,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:40:24,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:24,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:24,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:40:25,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:40:25,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:25,153 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:40:25,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-02-06 10:40:25,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:40:25,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:25,352 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 16 treesize of output 8 [2025-02-06 10:40:25,355 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 11 treesize of output 3 [2025-02-06 10:40:25,677 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:40:25,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:40:25,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2025-02-06 10:40:25,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:40:26,206 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:26,206 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:26,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-02-06 10:40:26,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:40:26,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:40:26,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 10:40:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:26,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:27,031 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2352 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2352) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-02-06 10:40:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240469766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:31,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:31,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 68 [2025-02-06 10:40:31,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800880616] [2025-02-06 10:40:31,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:31,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-02-06 10:40:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:31,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-02-06 10:40:31,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5589, Unknown=135, NotChecked=152, Total=6162 [2025-02-06 10:40:31,936 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 68 states, 64 states have (on average 1.6875) internal successors, (108), 59 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:38,864 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2025-02-06 10:40:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-06 10:40:38,864 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 1.6875) internal successors, (108), 59 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2025-02-06 10:40:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:38,865 INFO L225 Difference]: With dead ends: 100 [2025-02-06 10:40:38,865 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 10:40:38,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2442 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=631, Invalid=11009, Unknown=136, NotChecked=214, Total=11990 [2025-02-06 10:40:38,866 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 97 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:38,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1910 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 10:40:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 10:40:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-02-06 10:40:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.236842105263158) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:40:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2025-02-06 10:40:38,868 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 63 [2025-02-06 10:40:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:38,868 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2025-02-06 10:40:38,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 1.6875) internal successors, (108), 59 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2025-02-06 10:40:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:40:38,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:38,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:38,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:40:39,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:39,069 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:39,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash 84020445, now seen corresponding path program 1 times [2025-02-06 10:40:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206437419] [2025-02-06 10:40:39,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:39,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:40:39,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:40:39,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:39,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:40:40,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:40,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206437419] [2025-02-06 10:40:40,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206437419] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:40,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949203540] [2025-02-06 10:40:40,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:40,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:40,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:40,205 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:40:40,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:40:40,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:40:40,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:40:40,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:40,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:40,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-06 10:40:40,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:40,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:40:40,510 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:40:40,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:40:40,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:40,654 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:40:40,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:40:40,754 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 38 treesize of output 14 [2025-02-06 10:40:40,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:40,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:40,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-02-06 10:40:40,926 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2025-02-06 10:40:40,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 65 [2025-02-06 10:40:41,167 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-02-06 10:40:41,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2025-02-06 10:40:41,300 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-06 10:40:41,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 88 [2025-02-06 10:40:41,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:40:41,460 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 152 treesize of output 104 [2025-02-06 10:40:41,465 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 103 treesize of output 75 [2025-02-06 10:40:41,674 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 79 treesize of output 51 [2025-02-06 10:40:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:40:41,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:41,920 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2507 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2507) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-02-06 10:40:46,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_2507 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2507) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-02-06 10:40:46,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949203540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:46,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:46,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2025-02-06 10:40:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179537960] [2025-02-06 10:40:46,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:46,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-06 10:40:46,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:46,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-06 10:40:46,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2665, Unknown=18, NotChecked=210, Total=3080 [2025-02-06 10:40:46,169 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 52 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 45 states have internal predecessors, (110), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:40:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:47,595 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2025-02-06 10:40:47,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 10:40:47,596 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 45 states have internal predecessors, (110), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2025-02-06 10:40:47,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:47,596 INFO L225 Difference]: With dead ends: 105 [2025-02-06 10:40:47,596 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 10:40:47,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=377, Invalid=4305, Unknown=18, NotChecked=270, Total=4970 [2025-02-06 10:40:47,597 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 68 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:47,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1287 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 10:40:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 10:40:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-02-06 10:40:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 95 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:40:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2025-02-06 10:40:47,599 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 66 [2025-02-06 10:40:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:47,599 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2025-02-06 10:40:47,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 45 states have internal predecessors, (110), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:40:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2025-02-06 10:40:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:40:47,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:47,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:47,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:40:47,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 10:40:47,800 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-06 10:40:47,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 84020446, now seen corresponding path program 1 times [2025-02-06 10:40:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546003569] [2025-02-06 10:40:47,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:47,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:40:47,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:40:47,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:47,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:50,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:50,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546003569] [2025-02-06 10:40:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546003569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:50,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959203897] [2025-02-06 10:40:50,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:50,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:50,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:50,056 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:40:50,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:40:50,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:40:50,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:40:50,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:50,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:50,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-02-06 10:40:50,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:50,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:40:50,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:40:50,568 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:40:50,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:40:50,584 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:40:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:40:50,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:50,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:50,870 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:40:50,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-02-06 10:40:50,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:40:51,057 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 55 treesize of output 19 [2025-02-06 10:40:51,060 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 15 treesize of output 3 [2025-02-06 10:40:51,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:51,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:40:51,329 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:40:51,329 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 24 treesize of output 27 [2025-02-06 10:40:51,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:51,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:51,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2025-02-06 10:40:51,352 INFO L349 Elim1Store]: treesize reduction 37, result has 47.1 percent of original size [2025-02-06 10:40:51,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 37 [2025-02-06 10:40:51,370 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-06 10:40:51,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-02-06 10:40:51,698 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-02-06 10:40:51,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2025-02-06 10:40:51,709 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2025-02-06 10:40:51,710 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 1 case distinctions, treesize of input 27 treesize of output 26 [2025-02-06 10:40:51,893 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-06 10:40:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 95 [2025-02-06 10:40:51,927 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-06 10:40:51,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 126 [2025-02-06 10:40:52,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:40:52,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:40:52,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3