./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-2.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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:35:09,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:35:09,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:35:09,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:35:09,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:35:09,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:35:09,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:35:09,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:35:09,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:35:09,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:35:09,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:35:09,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:35:09,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:35:09,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:35:09,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:35:09,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:35:09,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:35:09,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:35:09,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:35:09,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:35:09,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:35:09,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:35:09,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:35:09,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:35:09,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:35:09,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:35:09,381 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2025-02-08 06:35:09,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:35:09,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:35:09,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:35:09,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:35:09,601 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:35:09,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-02-08 06:35:10,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33e55419b/2d389b57528e4c5aa77059a9ba57aa2a/FLAG1a2f9c1b6 [2025-02-08 06:35:11,023 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:35:11,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-02-08 06:35:11,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33e55419b/2d389b57528e4c5aa77059a9ba57aa2a/FLAG1a2f9c1b6 [2025-02-08 06:35:11,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33e55419b/2d389b57528e4c5aa77059a9ba57aa2a [2025-02-08 06:35:11,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:35:11,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:35:11,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:35:11,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:35:11,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:35:11,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11, skipping insertion in model container [2025-02-08 06:35:11,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:35:11,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:35:11,325 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:35:11,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:35:11,386 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:35:11,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11 WrapperNode [2025-02-08 06:35:11,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:35:11,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:35:11,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:35:11,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:35:11,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,427 INFO L138 Inliner]: procedures = 125, calls = 84, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 278 [2025-02-08 06:35:11,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:35:11,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:35:11,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:35:11,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:35:11,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,463 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 3, 34, 10]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 2, 8, 3]. [2025-02-08 06:35:11,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:35:11,481 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:35:11,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:35:11,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:35:11,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (1/1) ... [2025-02-08 06:35:11,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:35:11,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:11,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:35:11,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:35:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:35:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:35:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:35:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:35:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2025-02-08 06:35:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2025-02-08 06:35:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-08 06:35:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:35:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:35:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:35:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:35:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:35:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:35:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 06:35:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:35:11,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:35:11,647 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:35:11,648 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:35:12,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L656: main_#t~ret42#1.base, main_#t~ret42#1.offset := seq_sort_core_#res#1.base, seq_sort_core_#res#1.offset;havoc seq_sort_core_#t~mem17#1.base, seq_sort_core_#t~mem17#1.offset, seq_sort_core_#t~mem18#1.base, seq_sort_core_#t~mem18#1.offset, seq_sort_core_#t~mem19#1.base, seq_sort_core_#t~mem19#1.offset, seq_sort_core_#t~mem20#1.base, seq_sort_core_#t~mem20#1.offset, seq_sort_core_~next~0#1.base, seq_sort_core_~next~0#1.offset, seq_sort_core_~data#1.base, seq_sort_core_~data#1.offset, seq_sort_core_~dst~0#1.base, seq_sort_core_~dst~0#1.offset;havoc seq_sort_core_#in~data#1.base, seq_sort_core_#in~data#1.offset;assume { :end_inline_seq_sort_core } true;main_~data~0#1.base, main_~data~0#1.offset := main_#t~ret42#1.base, main_#t~ret42#1.offset; [2025-02-08 06:35:12,160 INFO L? ?]: Removed 240 outVars from TransFormulas that were not future-live. [2025-02-08 06:35:12,161 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:35:12,177 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:35:12,180 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:35:12,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:35:12 BoogieIcfgContainer [2025-02-08 06:35:12,180 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:35:12,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:35:12,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:35:12,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:35:12,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:35:11" (1/3) ... [2025-02-08 06:35:12,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6662cb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:35:12, skipping insertion in model container [2025-02-08 06:35:12,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:11" (2/3) ... [2025-02-08 06:35:12,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6662cb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:35:12, skipping insertion in model container [2025-02-08 06:35:12,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:35:12" (3/3) ... [2025-02-08 06:35:12,189 INFO L128 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2025-02-08 06:35:12,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:35:12,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG merge_sort-2.i that has 3 procedures, 280 locations, 1 initial locations, 20 loop locations, and 105 error locations. [2025-02-08 06:35:12,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:35:12,254 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;@3c06d90e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:35:12,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-02-08 06:35:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 155 states have (on average 2.064516129032258) internal successors, (320), 277 states have internal predecessors, (320), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 06:35:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:35:12,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:12,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:35:12,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:12,269 INFO L85 PathProgramCache]: Analyzing trace with hash 354938738, now seen corresponding path program 1 times [2025-02-08 06:35:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750428454] [2025-02-08 06:35:12,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:12,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:12,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:35:12,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:35:12,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:12,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:12,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750428454] [2025-02-08 06:35:12,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750428454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:12,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:12,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:12,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087331099] [2025-02-08 06:35:12,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:12,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 06:35:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:12,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 06:35:12,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:35:12,398 INFO L87 Difference]: Start difference. First operand has 280 states, 155 states have (on average 2.064516129032258) internal successors, (320), 277 states have internal predecessors, (320), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:12,417 INFO L93 Difference]: Finished difference Result 277 states and 300 transitions. [2025-02-08 06:35:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 06:35:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:35:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:12,424 INFO L225 Difference]: With dead ends: 277 [2025-02-08 06:35:12,424 INFO L226 Difference]: Without dead ends: 271 [2025-02-08 06:35:12,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:35:12,427 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:12,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-08 06:35:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-08 06:35:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 150 states have (on average 1.84) internal successors, (276), 268 states have internal predecessors, (276), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 293 transitions. [2025-02-08 06:35:12,498 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 293 transitions. Word has length 5 [2025-02-08 06:35:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:12,498 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 293 transitions. [2025-02-08 06:35:12,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 293 transitions. [2025-02-08 06:35:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:35:12,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:12,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:35:12,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:35:12,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:12,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash 354938769, now seen corresponding path program 1 times [2025-02-08 06:35:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:12,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914662968] [2025-02-08 06:35:12,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:12,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:35:12,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:35:12,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:12,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914662968] [2025-02-08 06:35:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914662968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150523188] [2025-02-08 06:35:12,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:12,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:12,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:12,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:12,579 INFO L87 Difference]: Start difference. First operand 271 states and 293 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:12,752 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2025-02-08 06:35:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:12,753 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:35:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:12,755 INFO L225 Difference]: With dead ends: 269 [2025-02-08 06:35:12,757 INFO L226 Difference]: Without dead ends: 269 [2025-02-08 06:35:12,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:12,758 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 6 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:12,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 462 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-08 06:35:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-02-08 06:35:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 150 states have (on average 1.8266666666666667) internal successors, (274), 266 states have internal predecessors, (274), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2025-02-08 06:35:12,777 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 5 [2025-02-08 06:35:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:12,777 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2025-02-08 06:35:12,777 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2025-02-08 06:35:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:35:12,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:12,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:35:12,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:35:12,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:12,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 354938770, now seen corresponding path program 1 times [2025-02-08 06:35:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608132721] [2025-02-08 06:35:12,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:12,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:35:12,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:35:12,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:12,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:12,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:12,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608132721] [2025-02-08 06:35:12,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608132721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:12,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491873137] [2025-02-08 06:35:12,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:12,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:12,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:12,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:12,882 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,009 INFO L93 Difference]: Finished difference Result 267 states and 289 transitions. [2025-02-08 06:35:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:13,010 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:35:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,011 INFO L225 Difference]: With dead ends: 267 [2025-02-08 06:35:13,012 INFO L226 Difference]: Without dead ends: 267 [2025-02-08 06:35:13,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:13,012 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 470 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-08 06:35:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-02-08 06:35:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 150 states have (on average 1.8133333333333332) internal successors, (272), 264 states have internal predecessors, (272), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 289 transitions. [2025-02-08 06:35:13,026 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 289 transitions. Word has length 5 [2025-02-08 06:35:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,026 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 289 transitions. [2025-02-08 06:35:13,026 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 289 transitions. [2025-02-08 06:35:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:35:13,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:35:13,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:13,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1879034896, now seen corresponding path program 1 times [2025-02-08 06:35:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643212974] [2025-02-08 06:35:13,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:35:13,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:35:13,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643212974] [2025-02-08 06:35:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643212974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261221207] [2025-02-08 06:35:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:13,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:13,061 INFO L87 Difference]: Start difference. First operand 267 states and 289 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,082 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2025-02-08 06:35:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:13,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2025-02-08 06:35:13,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,084 INFO L225 Difference]: With dead ends: 282 [2025-02-08 06:35:13,084 INFO L226 Difference]: Without dead ends: 281 [2025-02-08 06:35:13,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:13,084 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 12 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 559 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-08 06:35:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 269. [2025-02-08 06:35:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 152 states have (on average 1.8026315789473684) internal successors, (274), 266 states have internal predecessors, (274), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2025-02-08 06:35:13,091 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 10 [2025-02-08 06:35:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,091 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2025-02-08 06:35:13,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2025-02-08 06:35:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:35:13,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:35:13,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:13,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash -369939338, now seen corresponding path program 1 times [2025-02-08 06:35:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346538561] [2025-02-08 06:35:13,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:35:13,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:35:13,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346538561] [2025-02-08 06:35:13,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346538561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649529661] [2025-02-08 06:35:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:13,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:13,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:13,150 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,260 INFO L93 Difference]: Finished difference Result 267 states and 289 transitions. [2025-02-08 06:35:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:35:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,261 INFO L225 Difference]: With dead ends: 267 [2025-02-08 06:35:13,261 INFO L226 Difference]: Without dead ends: 267 [2025-02-08 06:35:13,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:13,262 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 2 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 461 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-08 06:35:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-02-08 06:35:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 152 states have (on average 1.7894736842105263) internal successors, (272), 264 states have internal predecessors, (272), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 289 transitions. [2025-02-08 06:35:13,267 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 289 transitions. Word has length 10 [2025-02-08 06:35:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,267 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 289 transitions. [2025-02-08 06:35:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 289 transitions. [2025-02-08 06:35:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:35:13,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:35:13,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:13,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash -369939337, now seen corresponding path program 1 times [2025-02-08 06:35:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804287952] [2025-02-08 06:35:13,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:35:13,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:35:13,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804287952] [2025-02-08 06:35:13,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804287952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996184446] [2025-02-08 06:35:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:13,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:13,364 INFO L87 Difference]: Start difference. First operand 267 states and 289 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,464 INFO L93 Difference]: Finished difference Result 265 states and 287 transitions. [2025-02-08 06:35:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:35:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,465 INFO L225 Difference]: With dead ends: 265 [2025-02-08 06:35:13,465 INFO L226 Difference]: Without dead ends: 265 [2025-02-08 06:35:13,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:13,467 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 469 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-08 06:35:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-02-08 06:35:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 152 states have (on average 1.7763157894736843) internal successors, (270), 262 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 287 transitions. [2025-02-08 06:35:13,473 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 287 transitions. Word has length 10 [2025-02-08 06:35:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,473 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 287 transitions. [2025-02-08 06:35:13,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 287 transitions. [2025-02-08 06:35:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:35:13,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,474 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:35:13,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:13,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1892614513, now seen corresponding path program 1 times [2025-02-08 06:35:13,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271451812] [2025-02-08 06:35:13,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:35:13,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:35:13,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271451812] [2025-02-08 06:35:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271451812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700860837] [2025-02-08 06:35:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:13,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:13,544 INFO L87 Difference]: Start difference. First operand 265 states and 287 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,642 INFO L93 Difference]: Finished difference Result 310 states and 354 transitions. [2025-02-08 06:35:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:13,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 21 [2025-02-08 06:35:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,644 INFO L225 Difference]: With dead ends: 310 [2025-02-08 06:35:13,644 INFO L226 Difference]: Without dead ends: 310 [2025-02-08 06:35:13,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:13,644 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 240 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 866 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-08 06:35:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 270. [2025-02-08 06:35:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 159 states have (on average 1.748427672955975) internal successors, (278), 267 states have internal predecessors, (278), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 294 transitions. [2025-02-08 06:35:13,650 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 294 transitions. Word has length 21 [2025-02-08 06:35:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,650 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 294 transitions. [2025-02-08 06:35:13,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 294 transitions. [2025-02-08 06:35:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:35:13,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,650 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:35:13,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:13,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1185898841, now seen corresponding path program 1 times [2025-02-08 06:35:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597485217] [2025-02-08 06:35:13,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:35:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:35:13,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597485217] [2025-02-08 06:35:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597485217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:35:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341640567] [2025-02-08 06:35:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:13,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:13,730 INFO L87 Difference]: Start difference. First operand 270 states and 294 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,958 INFO L93 Difference]: Finished difference Result 268 states and 291 transitions. [2025-02-08 06:35:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 06:35:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,959 INFO L225 Difference]: With dead ends: 268 [2025-02-08 06:35:13,959 INFO L226 Difference]: Without dead ends: 268 [2025-02-08 06:35:13,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:13,960 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 170 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 557 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-08 06:35:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2025-02-08 06:35:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 159 states have (on average 1.679245283018868) internal successors, (267), 257 states have internal predecessors, (267), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 283 transitions. [2025-02-08 06:35:13,969 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 283 transitions. Word has length 20 [2025-02-08 06:35:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,969 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 283 transitions. [2025-02-08 06:35:13,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 283 transitions. [2025-02-08 06:35:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:35:13,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,969 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:35:13,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1185898840, now seen corresponding path program 1 times [2025-02-08 06:35:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533263858] [2025-02-08 06:35:13,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:35:13,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:35:13,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533263858] [2025-02-08 06:35:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533263858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:14,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:14,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:35:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444865024] [2025-02-08 06:35:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:14,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:14,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:14,100 INFO L87 Difference]: Start difference. First operand 260 states and 283 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:14,340 INFO L93 Difference]: Finished difference Result 306 states and 334 transitions. [2025-02-08 06:35:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:14,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 06:35:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:14,341 INFO L225 Difference]: With dead ends: 306 [2025-02-08 06:35:14,341 INFO L226 Difference]: Without dead ends: 306 [2025-02-08 06:35:14,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:14,342 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 210 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:14,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 619 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-08 06:35:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2025-02-08 06:35:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 185 states have (on average 1.6054054054054054) internal successors, (297), 281 states have internal predecessors, (297), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 313 transitions. [2025-02-08 06:35:14,347 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 313 transitions. Word has length 20 [2025-02-08 06:35:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:14,347 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 313 transitions. [2025-02-08 06:35:14,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 313 transitions. [2025-02-08 06:35:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:35:14,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:14,348 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:14,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:35:14,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:14,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:14,349 INFO L85 PathProgramCache]: Analyzing trace with hash -989556629, now seen corresponding path program 1 times [2025-02-08 06:35:14,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:14,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120942576] [2025-02-08 06:35:14,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:14,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:35:14,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:35:14,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:14,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:14,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120942576] [2025-02-08 06:35:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120942576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:14,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:14,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755496496] [2025-02-08 06:35:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:14,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:14,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:14,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:14,444 INFO L87 Difference]: Start difference. First operand 284 states and 313 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:14,543 INFO L93 Difference]: Finished difference Result 283 states and 310 transitions. [2025-02-08 06:35:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:35:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 31 [2025-02-08 06:35:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:14,544 INFO L225 Difference]: With dead ends: 283 [2025-02-08 06:35:14,544 INFO L226 Difference]: Without dead ends: 283 [2025-02-08 06:35:14,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:14,544 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 17 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:14,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 920 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-08 06:35:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-02-08 06:35:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 185 states have (on average 1.5945945945945945) internal successors, (295), 280 states have internal predecessors, (295), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 310 transitions. [2025-02-08 06:35:14,557 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 310 transitions. Word has length 31 [2025-02-08 06:35:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:14,558 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 310 transitions. [2025-02-08 06:35:14,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 310 transitions. [2025-02-08 06:35:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:35:14,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:14,558 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:14,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:35:14,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:14,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1581518924, now seen corresponding path program 1 times [2025-02-08 06:35:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:14,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268431915] [2025-02-08 06:35:14,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:14,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:14,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:35:14,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:35:14,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:14,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268431915] [2025-02-08 06:35:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268431915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:14,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48912489] [2025-02-08 06:35:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:14,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:14,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:14,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:14,646 INFO L87 Difference]: Start difference. First operand 283 states and 310 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:14,740 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2025-02-08 06:35:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:35:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 31 [2025-02-08 06:35:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:14,741 INFO L225 Difference]: With dead ends: 282 [2025-02-08 06:35:14,741 INFO L226 Difference]: Without dead ends: 282 [2025-02-08 06:35:14,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:14,742 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 17 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:14,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 916 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-08 06:35:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-02-08 06:35:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 185 states have (on average 1.5837837837837838) internal successors, (293), 279 states have internal predecessors, (293), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 307 transitions. [2025-02-08 06:35:14,747 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 307 transitions. Word has length 31 [2025-02-08 06:35:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:14,747 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 307 transitions. [2025-02-08 06:35:14,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 307 transitions. [2025-02-08 06:35:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:14,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:14,750 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:14,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:35:14,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:14,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash 901954729, now seen corresponding path program 1 times [2025-02-08 06:35:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546442298] [2025-02-08 06:35:14,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:14,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:14,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:14,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:14,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:14,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546442298] [2025-02-08 06:35:14,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546442298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:14,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:14,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136725939] [2025-02-08 06:35:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:14,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:14,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:14,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:14,931 INFO L87 Difference]: Start difference. First operand 282 states and 307 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:15,097 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2025-02-08 06:35:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:15,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 35 [2025-02-08 06:35:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:15,099 INFO L225 Difference]: With dead ends: 295 [2025-02-08 06:35:15,099 INFO L226 Difference]: Without dead ends: 295 [2025-02-08 06:35:15,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:15,100 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 188 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:15,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1242 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-08 06:35:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 282. [2025-02-08 06:35:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 185 states have (on average 1.5783783783783785) internal successors, (292), 279 states have internal predecessors, (292), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 306 transitions. [2025-02-08 06:35:15,106 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 306 transitions. Word has length 35 [2025-02-08 06:35:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 306 transitions. [2025-02-08 06:35:15,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 306 transitions. [2025-02-08 06:35:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:15,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:15,107 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:35:15,108 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 485877874, now seen corresponding path program 1 times [2025-02-08 06:35:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:15,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363270563] [2025-02-08 06:35:15,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:15,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:15,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:15,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:15,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363270563] [2025-02-08 06:35:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363270563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:15,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:15,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007376871] [2025-02-08 06:35:15,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:15,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:15,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:15,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:15,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:15,246 INFO L87 Difference]: Start difference. First operand 282 states and 306 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:15,400 INFO L93 Difference]: Finished difference Result 294 states and 316 transitions. [2025-02-08 06:35:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:15,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 35 [2025-02-08 06:35:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:15,402 INFO L225 Difference]: With dead ends: 294 [2025-02-08 06:35:15,402 INFO L226 Difference]: Without dead ends: 294 [2025-02-08 06:35:15,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:15,403 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 186 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:15,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1242 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-08 06:35:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 282. [2025-02-08 06:35:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 185 states have (on average 1.572972972972973) internal successors, (291), 279 states have internal predecessors, (291), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 305 transitions. [2025-02-08 06:35:15,407 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 305 transitions. Word has length 35 [2025-02-08 06:35:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:15,407 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 305 transitions. [2025-02-08 06:35:15,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 305 transitions. [2025-02-08 06:35:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:15,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:15,408 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:15,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:35:15,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:15,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 900314166, now seen corresponding path program 1 times [2025-02-08 06:35:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85202115] [2025-02-08 06:35:15,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:15,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:15,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:15,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:15,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:15,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85202115] [2025-02-08 06:35:15,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85202115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:15,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:15,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:35:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064415509] [2025-02-08 06:35:15,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:15,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:35:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:15,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:35:15,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:35:15,587 INFO L87 Difference]: Start difference. First operand 282 states and 305 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:15,958 INFO L93 Difference]: Finished difference Result 293 states and 315 transitions. [2025-02-08 06:35:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:35:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 06:35:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:15,960 INFO L225 Difference]: With dead ends: 293 [2025-02-08 06:35:15,960 INFO L226 Difference]: Without dead ends: 293 [2025-02-08 06:35:15,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:35:15,960 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 182 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:15,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1039 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-08 06:35:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 282. [2025-02-08 06:35:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 185 states have (on average 1.5675675675675675) internal successors, (290), 279 states have internal predecessors, (290), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 304 transitions. [2025-02-08 06:35:15,966 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 304 transitions. Word has length 35 [2025-02-08 06:35:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:15,966 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 304 transitions. [2025-02-08 06:35:15,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 304 transitions. [2025-02-08 06:35:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:15,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:15,967 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:15,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:35:15,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:15,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 900314167, now seen corresponding path program 1 times [2025-02-08 06:35:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888227146] [2025-02-08 06:35:15,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:15,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:15,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:15,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888227146] [2025-02-08 06:35:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888227146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:16,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:35:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003389960] [2025-02-08 06:35:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:16,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:16,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:16,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:16,230 INFO L87 Difference]: Start difference. First operand 282 states and 304 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:16,577 INFO L93 Difference]: Finished difference Result 292 states and 314 transitions. [2025-02-08 06:35:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 06:35:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:16,578 INFO L225 Difference]: With dead ends: 292 [2025-02-08 06:35:16,578 INFO L226 Difference]: Without dead ends: 292 [2025-02-08 06:35:16,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:16,579 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 177 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:16,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 905 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-08 06:35:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2025-02-08 06:35:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 185 states have (on average 1.5621621621621622) internal successors, (289), 279 states have internal predecessors, (289), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 303 transitions. [2025-02-08 06:35:16,583 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 303 transitions. Word has length 35 [2025-02-08 06:35:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:16,583 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 303 transitions. [2025-02-08 06:35:16,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 303 transitions. [2025-02-08 06:35:16,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:16,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:16,584 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:16,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:35:16,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:16,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 483121143, now seen corresponding path program 1 times [2025-02-08 06:35:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:16,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468149965] [2025-02-08 06:35:16,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:16,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:16,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:16,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:16,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468149965] [2025-02-08 06:35:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468149965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:16,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:16,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:16,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557719290] [2025-02-08 06:35:16,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:16,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:35:16,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:16,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:35:16,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:16,743 INFO L87 Difference]: Start difference. First operand 282 states and 303 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:17,077 INFO L93 Difference]: Finished difference Result 291 states and 313 transitions. [2025-02-08 06:35:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:17,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 06:35:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:17,079 INFO L225 Difference]: With dead ends: 291 [2025-02-08 06:35:17,079 INFO L226 Difference]: Without dead ends: 291 [2025-02-08 06:35:17,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:35:17,079 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 176 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:17,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1048 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-08 06:35:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 283. [2025-02-08 06:35:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 186 states have (on average 1.564516129032258) internal successors, (291), 280 states have internal predecessors, (291), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 305 transitions. [2025-02-08 06:35:17,085 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 305 transitions. Word has length 35 [2025-02-08 06:35:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:17,085 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 305 transitions. [2025-02-08 06:35:17,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 305 transitions. [2025-02-08 06:35:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:17,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:17,086 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:17,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:35:17,086 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:17,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash 483121144, now seen corresponding path program 1 times [2025-02-08 06:35:17,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:17,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258349871] [2025-02-08 06:35:17,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:17,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:17,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:17,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:17,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:17,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258349871] [2025-02-08 06:35:17,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258349871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:17,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:17,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:35:17,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698001769] [2025-02-08 06:35:17,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:17,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:17,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:17,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:17,313 INFO L87 Difference]: Start difference. First operand 283 states and 305 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:17,657 INFO L93 Difference]: Finished difference Result 290 states and 312 transitions. [2025-02-08 06:35:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 06:35:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:17,659 INFO L225 Difference]: With dead ends: 290 [2025-02-08 06:35:17,659 INFO L226 Difference]: Without dead ends: 290 [2025-02-08 06:35:17,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:17,659 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 173 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:17,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 905 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-08 06:35:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 283. [2025-02-08 06:35:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 280 states have internal predecessors, (290), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 304 transitions. [2025-02-08 06:35:17,664 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 304 transitions. Word has length 35 [2025-02-08 06:35:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:17,664 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 304 transitions. [2025-02-08 06:35:17,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 304 transitions. [2025-02-08 06:35:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:35:17,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:17,665 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:35:17,665 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:17,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2109442721, now seen corresponding path program 1 times [2025-02-08 06:35:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648841816] [2025-02-08 06:35:17,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:17,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:17,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:17,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:17,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648841816] [2025-02-08 06:35:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648841816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:17,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:35:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204421381] [2025-02-08 06:35:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:17,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:35:17,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:17,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:35:17,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:17,987 INFO L87 Difference]: Start difference. First operand 283 states and 304 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:18,290 INFO L93 Difference]: Finished difference Result 289 states and 310 transitions. [2025-02-08 06:35:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:35:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 40 [2025-02-08 06:35:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:18,291 INFO L225 Difference]: With dead ends: 289 [2025-02-08 06:35:18,291 INFO L226 Difference]: Without dead ends: 289 [2025-02-08 06:35:18,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:35:18,292 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 173 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:18,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1592 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-08 06:35:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 283. [2025-02-08 06:35:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 186 states have (on average 1.553763440860215) internal successors, (289), 280 states have internal predecessors, (289), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 303 transitions. [2025-02-08 06:35:18,296 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 303 transitions. Word has length 40 [2025-02-08 06:35:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:18,296 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 303 transitions. [2025-02-08 06:35:18,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 303 transitions. [2025-02-08 06:35:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:35:18,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:18,297 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:18,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:35:18,297 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:18,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1134630308, now seen corresponding path program 1 times [2025-02-08 06:35:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339616350] [2025-02-08 06:35:18,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:18,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:18,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:18,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:18,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:18,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339616350] [2025-02-08 06:35:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339616350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:18,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:18,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:35:18,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707969848] [2025-02-08 06:35:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:18,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:35:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:18,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:35:18,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:18,605 INFO L87 Difference]: Start difference. First operand 283 states and 303 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:18,938 INFO L93 Difference]: Finished difference Result 288 states and 308 transitions. [2025-02-08 06:35:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:35:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 40 [2025-02-08 06:35:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:18,940 INFO L225 Difference]: With dead ends: 288 [2025-02-08 06:35:18,940 INFO L226 Difference]: Without dead ends: 288 [2025-02-08 06:35:18,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:35:18,940 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 171 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:18,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1808 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-08 06:35:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2025-02-08 06:35:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 187 states have (on average 1.5508021390374331) internal successors, (290), 281 states have internal predecessors, (290), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2025-02-08 06:35:18,947 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 40 [2025-02-08 06:35:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:18,947 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2025-02-08 06:35:18,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2025-02-08 06:35:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:35:18,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:18,948 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:35:18,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:35:18,948 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash 906771631, now seen corresponding path program 1 times [2025-02-08 06:35:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243484104] [2025-02-08 06:35:18,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:18,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:35:18,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:35:18,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:18,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243484104] [2025-02-08 06:35:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243484104] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287828193] [2025-02-08 06:35:19,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:19,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:19,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:19,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:35:19,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:35:19,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:35:19,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:19,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:19,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 06:35:19,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:19,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:19,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:19,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:19,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287828193] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:19,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:19,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2025-02-08 06:35:19,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954349856] [2025-02-08 06:35:19,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:19,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:35:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:19,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:35:19,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:35:19,616 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:19,914 INFO L93 Difference]: Finished difference Result 370 states and 397 transitions. [2025-02-08 06:35:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:35:19,915 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-08 06:35:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:19,917 INFO L225 Difference]: With dead ends: 370 [2025-02-08 06:35:19,917 INFO L226 Difference]: Without dead ends: 370 [2025-02-08 06:35:19,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:35:19,918 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 165 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:19,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 2253 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-08 06:35:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 302. [2025-02-08 06:35:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 205 states have (on average 1.5073170731707317) internal successors, (309), 299 states have internal predecessors, (309), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 323 transitions. [2025-02-08 06:35:19,927 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 323 transitions. Word has length 41 [2025-02-08 06:35:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:19,927 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 323 transitions. [2025-02-08 06:35:19,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 323 transitions. [2025-02-08 06:35:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 06:35:19,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:19,928 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-02-08 06:35:19,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:20,132 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:20,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1868220046, now seen corresponding path program 1 times [2025-02-08 06:35:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105349187] [2025-02-08 06:35:20,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:20,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 06:35:20,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:35:20,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:20,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:20,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:20,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105349187] [2025-02-08 06:35:20,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105349187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:20,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:20,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:35:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499270660] [2025-02-08 06:35:20,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:20,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:35:20,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:20,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:35:20,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:35:20,185 INFO L87 Difference]: Start difference. First operand 302 states and 323 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:20,322 INFO L93 Difference]: Finished difference Result 302 states and 324 transitions. [2025-02-08 06:35:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:35:20,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-08 06:35:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:20,324 INFO L225 Difference]: With dead ends: 302 [2025-02-08 06:35:20,324 INFO L226 Difference]: Without dead ends: 302 [2025-02-08 06:35:20,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:35:20,324 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 105 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:20,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 455 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-08 06:35:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-02-08 06:35:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 207 states have (on average 1.497584541062802) internal successors, (310), 299 states have internal predecessors, (310), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 324 transitions. [2025-02-08 06:35:20,329 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 324 transitions. Word has length 43 [2025-02-08 06:35:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:20,329 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 324 transitions. [2025-02-08 06:35:20,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 324 transitions. [2025-02-08 06:35:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 06:35:20,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:20,330 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-02-08 06:35:20,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:35:20,330 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:20,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1868220047, now seen corresponding path program 1 times [2025-02-08 06:35:20,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531957575] [2025-02-08 06:35:20,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:20,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 06:35:20,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:35:20,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:20,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:20,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531957575] [2025-02-08 06:35:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531957575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:20,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:20,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:35:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515213757] [2025-02-08 06:35:20,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:20,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:20,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:20,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:20,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:20,434 INFO L87 Difference]: Start difference. First operand 302 states and 324 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:20,657 INFO L93 Difference]: Finished difference Result 310 states and 331 transitions. [2025-02-08 06:35:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:20,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-08 06:35:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:20,659 INFO L225 Difference]: With dead ends: 310 [2025-02-08 06:35:20,659 INFO L226 Difference]: Without dead ends: 309 [2025-02-08 06:35:20,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:20,660 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 97 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:20,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 606 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-08 06:35:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2025-02-08 06:35:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 210 states have (on average 1.4857142857142858) internal successors, (312), 302 states have internal predecessors, (312), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 326 transitions. [2025-02-08 06:35:20,666 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 326 transitions. Word has length 43 [2025-02-08 06:35:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:20,666 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 326 transitions. [2025-02-08 06:35:20,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 326 transitions. [2025-02-08 06:35:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:35:20,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:20,667 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:20,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 06:35:20,667 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:20,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:20,668 INFO L85 PathProgramCache]: Analyzing trace with hash 541280669, now seen corresponding path program 1 times [2025-02-08 06:35:20,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:20,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46138642] [2025-02-08 06:35:20,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:20,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:35:20,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:35:20,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:20,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46138642] [2025-02-08 06:35:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46138642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:35:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921696077] [2025-02-08 06:35:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:35:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:20,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:35:20,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:20,737 INFO L87 Difference]: Start difference. First operand 305 states and 326 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:20,795 INFO L93 Difference]: Finished difference Result 304 states and 324 transitions. [2025-02-08 06:35:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 48 [2025-02-08 06:35:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:20,797 INFO L225 Difference]: With dead ends: 304 [2025-02-08 06:35:20,797 INFO L226 Difference]: Without dead ends: 304 [2025-02-08 06:35:20,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:35:20,798 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 212 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:20,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 983 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-08 06:35:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-08 06:35:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 210 states have (on average 1.480952380952381) internal successors, (311), 301 states have internal predecessors, (311), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 324 transitions. [2025-02-08 06:35:20,804 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 324 transitions. Word has length 48 [2025-02-08 06:35:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:20,804 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 324 transitions. [2025-02-08 06:35:20,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 324 transitions. [2025-02-08 06:35:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 06:35:20,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:20,805 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-08 06:35:20,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:35:20,805 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:20,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:20,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1264183272, now seen corresponding path program 1 times [2025-02-08 06:35:20,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:20,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063409570] [2025-02-08 06:35:20,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:20,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:20,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 06:35:20,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 06:35:20,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:20,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:20,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:20,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063409570] [2025-02-08 06:35:20,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063409570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:20,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:20,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:20,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180056092] [2025-02-08 06:35:20,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:20,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:35:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:20,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:35:20,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:20,865 INFO L87 Difference]: Start difference. First operand 304 states and 324 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:21,023 INFO L93 Difference]: Finished difference Result 303 states and 323 transitions. [2025-02-08 06:35:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:21,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-08 06:35:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:21,024 INFO L225 Difference]: With dead ends: 303 [2025-02-08 06:35:21,024 INFO L226 Difference]: Without dead ends: 303 [2025-02-08 06:35:21,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:21,025 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 149 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:21,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 651 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-08 06:35:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2025-02-08 06:35:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 210 states have (on average 1.4666666666666666) internal successors, (308), 298 states have internal predecessors, (308), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions. [2025-02-08 06:35:21,030 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 47 [2025-02-08 06:35:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:21,030 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions. [2025-02-08 06:35:21,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions. [2025-02-08 06:35:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 06:35:21,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:21,030 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-08 06:35:21,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 06:35:21,031 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:21,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1264183273, now seen corresponding path program 1 times [2025-02-08 06:35:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401654825] [2025-02-08 06:35:21,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:21,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 06:35:21,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 06:35:21,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:21,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:21,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:21,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401654825] [2025-02-08 06:35:21,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401654825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:21,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:21,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:35:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32537413] [2025-02-08 06:35:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:21,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:21,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:21,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:21,139 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:21,333 INFO L93 Difference]: Finished difference Result 298 states and 318 transitions. [2025-02-08 06:35:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:21,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-08 06:35:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:21,335 INFO L225 Difference]: With dead ends: 298 [2025-02-08 06:35:21,335 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 06:35:21,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:21,335 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 91 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:21,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 591 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 06:35:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-02-08 06:35:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 210 states have (on average 1.4523809523809523) internal successors, (305), 295 states have internal predecessors, (305), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 318 transitions. [2025-02-08 06:35:21,339 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 318 transitions. Word has length 47 [2025-02-08 06:35:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:21,339 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 318 transitions. [2025-02-08 06:35:21,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 318 transitions. [2025-02-08 06:35:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 06:35:21,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:21,340 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-08 06:35:21,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 06:35:21,340 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:21,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash 547861674, now seen corresponding path program 1 times [2025-02-08 06:35:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:21,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640092067] [2025-02-08 06:35:21,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:21,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 06:35:21,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 06:35:21,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:21,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:21,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640092067] [2025-02-08 06:35:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640092067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442910441] [2025-02-08 06:35:21,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:21,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:21,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:21,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:21,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:35:21,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 06:35:21,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 06:35:21,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:21,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:21,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:35:21,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:21,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:21,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:21,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:22,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442910441] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:22,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:22,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2025-02-08 06:35:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484780635] [2025-02-08 06:35:22,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:22,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:35:22,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:22,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:35:22,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:35:22,029 INFO L87 Difference]: Start difference. First operand 298 states and 318 transitions. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 14 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:22,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:22,286 INFO L93 Difference]: Finished difference Result 359 states and 383 transitions. [2025-02-08 06:35:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:35:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 14 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-08 06:35:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:22,287 INFO L225 Difference]: With dead ends: 359 [2025-02-08 06:35:22,287 INFO L226 Difference]: Without dead ends: 359 [2025-02-08 06:35:22,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:35:22,288 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 41 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:22,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2440 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-08 06:35:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 318. [2025-02-08 06:35:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 315 states have internal predecessors, (325), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 338 transitions. [2025-02-08 06:35:22,297 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 338 transitions. Word has length 47 [2025-02-08 06:35:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:22,297 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 338 transitions. [2025-02-08 06:35:22,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 14 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 338 transitions. [2025-02-08 06:35:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:35:22,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:22,298 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:22,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:35:22,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:35:22,498 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:22,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1545371237, now seen corresponding path program 1 times [2025-02-08 06:35:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432102437] [2025-02-08 06:35:22,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:22,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:35:22,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:35:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:22,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432102437] [2025-02-08 06:35:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432102437] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502371676] [2025-02-08 06:35:22,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:22,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:22,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:22,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:35:22,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:35:22,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:35:22,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:22,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:22,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:35:22,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:22,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:22,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:23,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:23,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502371676] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:23,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:23,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 12 [2025-02-08 06:35:23,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668905415] [2025-02-08 06:35:23,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:23,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:35:23,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:23,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:35:23,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:35:23,281 INFO L87 Difference]: Start difference. First operand 318 states and 338 transitions. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:23,470 INFO L93 Difference]: Finished difference Result 358 states and 381 transitions. [2025-02-08 06:35:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:35:23,470 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 12 states have internal predecessors, (99), 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 52 [2025-02-08 06:35:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:23,471 INFO L225 Difference]: With dead ends: 358 [2025-02-08 06:35:23,471 INFO L226 Difference]: Without dead ends: 358 [2025-02-08 06:35:23,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:35:23,472 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 96 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:23,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1792 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-08 06:35:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 325. [2025-02-08 06:35:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 237 states have (on average 1.40084388185654) internal successors, (332), 322 states have internal predecessors, (332), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 345 transitions. [2025-02-08 06:35:23,476 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 345 transitions. Word has length 52 [2025-02-08 06:35:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:23,476 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 345 transitions. [2025-02-08 06:35:23,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 345 transitions. [2025-02-08 06:35:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:35:23,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:23,478 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:23,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:23,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:23,680 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:23,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1927191342, now seen corresponding path program 2 times [2025-02-08 06:35:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288011468] [2025-02-08 06:35:23,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:35:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:23,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:35:23,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:35:23,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:35:23,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:24,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288011468] [2025-02-08 06:35:24,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288011468] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843551615] [2025-02-08 06:35:24,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:35:24,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:24,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:24,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:24,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:35:24,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:35:24,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:35:24,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:35:24,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:24,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 06:35:24,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:24,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:24,219 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:24,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:35:24,258 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:24,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-08 06:35:24,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:24,328 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 44 treesize of output 32 [2025-02-08 06:35:24,641 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 26 treesize of output 14 [2025-02-08 06:35:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:24,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:25,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-02-08 06:35:25,090 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 158 treesize of output 148 [2025-02-08 06:35:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843551615] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:25,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:25,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 30 [2025-02-08 06:35:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721221008] [2025-02-08 06:35:25,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:25,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 06:35:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:25,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 06:35:25,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-02-08 06:35:25,263 INFO L87 Difference]: Start difference. First operand 325 states and 345 transitions. Second operand has 31 states, 30 states have (on average 4.233333333333333) internal successors, (127), 31 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:26,455 INFO L93 Difference]: Finished difference Result 363 states and 387 transitions. [2025-02-08 06:35:26,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:35:26,458 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.233333333333333) internal successors, (127), 31 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-08 06:35:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:26,459 INFO L225 Difference]: With dead ends: 363 [2025-02-08 06:35:26,459 INFO L226 Difference]: Without dead ends: 363 [2025-02-08 06:35:26,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:35:26,460 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 705 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:26,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2792 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 06:35:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-08 06:35:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 328. [2025-02-08 06:35:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 240 states have (on average 1.4) internal successors, (336), 325 states have internal predecessors, (336), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 349 transitions. [2025-02-08 06:35:26,464 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 349 transitions. Word has length 52 [2025-02-08 06:35:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:26,464 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 349 transitions. [2025-02-08 06:35:26,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.233333333333333) internal successors, (127), 31 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 349 transitions. [2025-02-08 06:35:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:35:26,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:26,465 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:26,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:26,665 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,SelfDestructingSolverStorable27 [2025-02-08 06:35:26,666 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:26,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1927191343, now seen corresponding path program 1 times [2025-02-08 06:35:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61996956] [2025-02-08 06:35:26,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:26,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:35:26,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:35:26,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:26,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:27,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:27,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61996956] [2025-02-08 06:35:27,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61996956] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:27,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175168849] [2025-02-08 06:35:27,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:27,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:27,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:27,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:27,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:35:27,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:35:27,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:35:27,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:27,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:27,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 06:35:27,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:27,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:27,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:27,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:27,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:27,308 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:35:27,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:35:27,384 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:27,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:35:27,401 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 06:35:27,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 06:35:27,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:27,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:27,661 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-08 06:35:27,666 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-08 06:35:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:27,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175168849] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:28,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 28 [2025-02-08 06:35:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992368685] [2025-02-08 06:35:28,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:28,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:35:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:28,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:35:28,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:35:28,275 INFO L87 Difference]: Start difference. First operand 328 states and 349 transitions. Second operand has 29 states, 28 states have (on average 5.107142857142857) internal successors, (143), 29 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:29,616 INFO L93 Difference]: Finished difference Result 403 states and 433 transitions. [2025-02-08 06:35:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:35:29,616 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.107142857142857) internal successors, (143), 29 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-08 06:35:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:29,617 INFO L225 Difference]: With dead ends: 403 [2025-02-08 06:35:29,617 INFO L226 Difference]: Without dead ends: 403 [2025-02-08 06:35:29,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=1466, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 06:35:29,618 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 733 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:29,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 2797 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 06:35:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-08 06:35:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 352. [2025-02-08 06:35:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 267 states have (on average 1.3632958801498127) internal successors, (364), 349 states have internal predecessors, (364), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 377 transitions. [2025-02-08 06:35:29,622 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 377 transitions. Word has length 52 [2025-02-08 06:35:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:29,622 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 377 transitions. [2025-02-08 06:35:29,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.107142857142857) internal successors, (143), 29 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 377 transitions. [2025-02-08 06:35:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:35:29,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:29,622 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:29,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:29,822 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,SelfDestructingSolverStorable28 [2025-02-08 06:35:29,823 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:29,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:29,823 INFO L85 PathProgramCache]: Analyzing trace with hash 182815001, now seen corresponding path program 1 times [2025-02-08 06:35:29,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:29,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264375698] [2025-02-08 06:35:29,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:29,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 06:35:29,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:35:29,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:29,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:29,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:29,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264375698] [2025-02-08 06:35:29,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264375698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:29,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:29,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 06:35:29,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703782591] [2025-02-08 06:35:29,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:29,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:35:29,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:29,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:35:29,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:35:29,985 INFO L87 Difference]: Start difference. First operand 352 states and 377 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:30,231 INFO L93 Difference]: Finished difference Result 393 states and 422 transitions. [2025-02-08 06:35:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:35:30,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 56 [2025-02-08 06:35:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:30,233 INFO L225 Difference]: With dead ends: 393 [2025-02-08 06:35:30,233 INFO L226 Difference]: Without dead ends: 393 [2025-02-08 06:35:30,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:35:30,233 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 234 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:30,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1692 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-08 06:35:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 368. [2025-02-08 06:35:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 283 states have (on average 1.3498233215547704) internal successors, (382), 365 states have internal predecessors, (382), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 395 transitions. [2025-02-08 06:35:30,238 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 395 transitions. Word has length 56 [2025-02-08 06:35:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:30,238 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 395 transitions. [2025-02-08 06:35:30,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 395 transitions. [2025-02-08 06:35:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 06:35:30,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:30,239 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:30,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 06:35:30,240 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1646350802, now seen corresponding path program 1 times [2025-02-08 06:35:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:30,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698009735] [2025-02-08 06:35:30,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:30,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 06:35:30,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 06:35:30,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:30,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:30,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:30,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698009735] [2025-02-08 06:35:30,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698009735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:30,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:30,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400450980] [2025-02-08 06:35:30,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:30,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:35:30,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:30,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:35:30,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:30,337 INFO L87 Difference]: Start difference. First operand 368 states and 395 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:30,607 INFO L93 Difference]: Finished difference Result 391 states and 421 transitions. [2025-02-08 06:35:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:35:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-08 06:35:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:30,608 INFO L225 Difference]: With dead ends: 391 [2025-02-08 06:35:30,608 INFO L226 Difference]: Without dead ends: 391 [2025-02-08 06:35:30,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:35:30,608 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 74 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:30,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1217 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-08 06:35:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 372. [2025-02-08 06:35:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 289 states have (on average 1.3391003460207613) internal successors, (387), 369 states have internal predecessors, (387), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 400 transitions. [2025-02-08 06:35:30,612 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 400 transitions. Word has length 58 [2025-02-08 06:35:30,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:30,612 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 400 transitions. [2025-02-08 06:35:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 400 transitions. [2025-02-08 06:35:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 06:35:30,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:30,613 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:30,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 06:35:30,613 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:30,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:30,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1646350803, now seen corresponding path program 1 times [2025-02-08 06:35:30,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:30,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963092902] [2025-02-08 06:35:30,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:30,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:30,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 06:35:30,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 06:35:30,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:30,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963092902] [2025-02-08 06:35:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963092902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:30,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:35:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132744821] [2025-02-08 06:35:30,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:30,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:35:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:30,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:35:30,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:35:30,819 INFO L87 Difference]: Start difference. First operand 372 states and 400 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:31,184 INFO L93 Difference]: Finished difference Result 399 states and 430 transitions. [2025-02-08 06:35:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:35:31,184 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-08 06:35:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:31,186 INFO L225 Difference]: With dead ends: 399 [2025-02-08 06:35:31,187 INFO L226 Difference]: Without dead ends: 399 [2025-02-08 06:35:31,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:35:31,187 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 172 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:31,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1715 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-08 06:35:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 376. [2025-02-08 06:35:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 293 states have (on average 1.3344709897610922) internal successors, (391), 373 states have internal predecessors, (391), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 404 transitions. [2025-02-08 06:35:31,195 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 404 transitions. Word has length 58 [2025-02-08 06:35:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:31,195 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 404 transitions. [2025-02-08 06:35:31,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 404 transitions. [2025-02-08 06:35:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 06:35:31,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:31,198 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:31,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 06:35:31,198 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:31,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1846870342, now seen corresponding path program 1 times [2025-02-08 06:35:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:31,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720140938] [2025-02-08 06:35:31,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:31,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 06:35:31,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:35:31,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:31,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:31,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:31,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720140938] [2025-02-08 06:35:31,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720140938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:31,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015784750] [2025-02-08 06:35:31,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:31,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:31,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:31,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:31,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:35:31,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 06:35:31,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:35:31,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:31,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:31,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 06:35:31,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:31,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:31,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:31,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:31,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:31,693 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:31,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 06:35:31,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 06:35:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015784750] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:31,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:31,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 14 [2025-02-08 06:35:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450400179] [2025-02-08 06:35:31,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:31,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:35:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:31,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:35:31,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:35:31,800 INFO L87 Difference]: Start difference. First operand 376 states and 404 transitions. Second operand has 15 states, 15 states have (on average 8.4) internal successors, (126), 14 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:32,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:32,049 INFO L93 Difference]: Finished difference Result 374 states and 398 transitions. [2025-02-08 06:35:32,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:32,050 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.4) internal successors, (126), 14 states have internal predecessors, (126), 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 59 [2025-02-08 06:35:32,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:32,050 INFO L225 Difference]: With dead ends: 374 [2025-02-08 06:35:32,051 INFO L226 Difference]: Without dead ends: 374 [2025-02-08 06:35:32,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:35:32,051 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 615 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:32,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 833 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-08 06:35:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-02-08 06:35:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 293 states have (on average 1.3208191126279865) internal successors, (387), 371 states have internal predecessors, (387), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 398 transitions. [2025-02-08 06:35:32,056 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 398 transitions. Word has length 59 [2025-02-08 06:35:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:32,056 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 398 transitions. [2025-02-08 06:35:32,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.4) internal successors, (126), 14 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 398 transitions. [2025-02-08 06:35:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 06:35:32,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:32,057 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:32,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:32,261 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,SelfDestructingSolverStorable32 [2025-02-08 06:35:32,261 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:32,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1074595863, now seen corresponding path program 2 times [2025-02-08 06:35:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801101139] [2025-02-08 06:35:32,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:35:32,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:32,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-08 06:35:32,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 58 statements. [2025-02-08 06:35:32,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:35:32,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:35:32,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:32,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801101139] [2025-02-08 06:35:32,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801101139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:32,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:32,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928203132] [2025-02-08 06:35:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:32,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:32,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:32,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:32,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:32,364 INFO L87 Difference]: Start difference. First operand 374 states and 398 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:32,489 INFO L93 Difference]: Finished difference Result 393 states and 418 transitions. [2025-02-08 06:35:32,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-08 06:35:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:32,490 INFO L225 Difference]: With dead ends: 393 [2025-02-08 06:35:32,491 INFO L226 Difference]: Without dead ends: 393 [2025-02-08 06:35:32,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:32,492 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 57 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:32,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1068 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-08 06:35:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 374. [2025-02-08 06:35:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 293 states have (on average 1.31740614334471) internal successors, (386), 371 states have internal predecessors, (386), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 397 transitions. [2025-02-08 06:35:32,497 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 397 transitions. Word has length 58 [2025-02-08 06:35:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:32,497 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 397 transitions. [2025-02-08 06:35:32,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 397 transitions. [2025-02-08 06:35:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 06:35:32,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:32,498 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:32,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 06:35:32,498 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:32,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1683264068, now seen corresponding path program 2 times [2025-02-08 06:35:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:32,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109795615] [2025-02-08 06:35:32,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:35:32,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:32,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-08 06:35:32,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 41 of 63 statements. [2025-02-08 06:35:32,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:35:32,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:35:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109795615] [2025-02-08 06:35:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109795615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:35:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84081966] [2025-02-08 06:35:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:35:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:32,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:35:32,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:32,613 INFO L87 Difference]: Start difference. First operand 374 states and 397 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:32,742 INFO L93 Difference]: Finished difference Result 392 states and 416 transitions. [2025-02-08 06:35:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:32,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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 63 [2025-02-08 06:35:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:32,743 INFO L225 Difference]: With dead ends: 392 [2025-02-08 06:35:32,743 INFO L226 Difference]: Without dead ends: 392 [2025-02-08 06:35:32,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:32,744 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 66 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:32,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1094 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-08 06:35:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 347. [2025-02-08 06:35:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 266 states have (on average 1.3458646616541354) internal successors, (358), 344 states have internal predecessors, (358), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 369 transitions. [2025-02-08 06:35:32,748 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 369 transitions. Word has length 63 [2025-02-08 06:35:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:32,748 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 369 transitions. [2025-02-08 06:35:32,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 369 transitions. [2025-02-08 06:35:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 06:35:32,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:32,749 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:32,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 06:35:32,749 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1808083860, now seen corresponding path program 1 times [2025-02-08 06:35:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247975913] [2025-02-08 06:35:32,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:32,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:35:32,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:35:32,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:32,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:32,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:32,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247975913] [2025-02-08 06:35:32,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247975913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:32,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:32,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:35:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830296717] [2025-02-08 06:35:32,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:32,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:35:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:32,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:35:32,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:32,922 INFO L87 Difference]: Start difference. First operand 347 states and 369 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:33,182 INFO L93 Difference]: Finished difference Result 353 states and 375 transitions. [2025-02-08 06:35:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:33,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-08 06:35:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:33,184 INFO L225 Difference]: With dead ends: 353 [2025-02-08 06:35:33,184 INFO L226 Difference]: Without dead ends: 353 [2025-02-08 06:35:33,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:35:33,185 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 54 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:33,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1853 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-08 06:35:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 346. [2025-02-08 06:35:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 265 states have (on average 1.3433962264150943) internal successors, (356), 343 states have internal predecessors, (356), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 367 transitions. [2025-02-08 06:35:33,193 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 367 transitions. Word has length 63 [2025-02-08 06:35:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:33,194 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 367 transitions. [2025-02-08 06:35:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 367 transitions. [2025-02-08 06:35:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:35:33,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:33,195 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:33,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 06:35:33,195 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:33,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash 371835853, now seen corresponding path program 1 times [2025-02-08 06:35:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691082224] [2025-02-08 06:35:33,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:33,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:33,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:35:33,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:35:33,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:33,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:33,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691082224] [2025-02-08 06:35:33,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691082224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:33,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:33,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:33,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708632502] [2025-02-08 06:35:33,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:33,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:33,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:33,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:33,271 INFO L87 Difference]: Start difference. First operand 346 states and 367 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:33,337 INFO L93 Difference]: Finished difference Result 345 states and 365 transitions. [2025-02-08 06:35:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:35:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 66 [2025-02-08 06:35:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:33,339 INFO L225 Difference]: With dead ends: 345 [2025-02-08 06:35:33,339 INFO L226 Difference]: Without dead ends: 345 [2025-02-08 06:35:33,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:33,339 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 3 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:33,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 880 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-08 06:35:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-02-08 06:35:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 265 states have (on average 1.3396226415094339) internal successors, (355), 342 states have internal predecessors, (355), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 365 transitions. [2025-02-08 06:35:33,344 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 365 transitions. Word has length 66 [2025-02-08 06:35:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:33,344 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 365 transitions. [2025-02-08 06:35:33,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 365 transitions. [2025-02-08 06:35:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 06:35:33,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:33,346 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:33,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 06:35:33,347 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:33,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:33,347 INFO L85 PathProgramCache]: Analyzing trace with hash 451494210, now seen corresponding path program 1 times [2025-02-08 06:35:33,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924346916] [2025-02-08 06:35:33,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:33,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:35:33,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:35:33,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:33,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:34,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924346916] [2025-02-08 06:35:34,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924346916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:34,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315037860] [2025-02-08 06:35:34,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:34,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:34,054 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:34,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:35:34,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:35:34,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:35:34,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:34,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:34,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-08 06:35:34,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:34,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:34,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:34,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:34,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:34,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:34,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:34,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:34,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:34,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:34,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 06:35:34,483 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:34,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:35:34,530 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-02-08 06:35:34,531 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 30 treesize of output 32 [2025-02-08 06:35:34,544 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-08 06:35:34,544 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 35 treesize of output 31 [2025-02-08 06:35:35,432 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-08 06:35:35,505 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-02-08 06:35:35,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 24 [2025-02-08 06:35:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:35,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:36,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:36,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 68 [2025-02-08 06:35:37,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:37,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 06:35:37,932 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 67 treesize of output 57 [2025-02-08 06:35:37,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:37,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2025-02-08 06:35:37,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:37,955 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 64 treesize of output 72 [2025-02-08 06:35:37,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-02-08 06:35:37,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:37,981 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 254 treesize of output 246 [2025-02-08 06:35:37,987 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:37,991 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 156 treesize of output 140 [2025-02-08 06:35:38,059 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:38,061 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 115 treesize of output 99 [2025-02-08 06:35:38,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:38,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2025-02-08 06:35:38,104 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:38,105 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 60 treesize of output 44 [2025-02-08 06:35:38,108 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:38,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:38,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 57 [2025-02-08 06:35:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:38,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315037860] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:38,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:38,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 21] total 58 [2025-02-08 06:35:38,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040124621] [2025-02-08 06:35:38,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:38,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-02-08 06:35:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:38,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-02-08 06:35:38,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3089, Unknown=3, NotChecked=0, Total=3306 [2025-02-08 06:35:38,284 INFO L87 Difference]: Start difference. First operand 345 states and 365 transitions. Second operand has 58 states, 58 states have (on average 3.1551724137931036) internal successors, (183), 58 states have internal predecessors, (183), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:42,358 INFO L93 Difference]: Finished difference Result 603 states and 636 transitions. [2025-02-08 06:35:42,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-08 06:35:42,359 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 3.1551724137931036) internal successors, (183), 58 states have internal predecessors, (183), 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 67 [2025-02-08 06:35:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:42,360 INFO L225 Difference]: With dead ends: 603 [2025-02-08 06:35:42,361 INFO L226 Difference]: Without dead ends: 603 [2025-02-08 06:35:42,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=824, Invalid=7915, Unknown=3, NotChecked=0, Total=8742 [2025-02-08 06:35:42,362 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 1782 mSDsluCounter, 7782 mSDsCounter, 0 mSdLazyCounter, 3729 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 8045 SdHoareTripleChecker+Invalid, 3770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:42,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 8045 Invalid, 3770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3729 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 06:35:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-02-08 06:35:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 418. [2025-02-08 06:35:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 338 states have (on average 1.2958579881656804) internal successors, (438), 415 states have internal predecessors, (438), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 448 transitions. [2025-02-08 06:35:42,368 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 448 transitions. Word has length 67 [2025-02-08 06:35:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:42,368 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 448 transitions. [2025-02-08 06:35:42,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 3.1551724137931036) internal successors, (183), 58 states have internal predecessors, (183), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 448 transitions. [2025-02-08 06:35:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 06:35:42,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:42,369 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:42,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:35:42,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:42,569 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:42,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:42,570 INFO L85 PathProgramCache]: Analyzing trace with hash 35417355, now seen corresponding path program 1 times [2025-02-08 06:35:42,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:42,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147489777] [2025-02-08 06:35:42,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:42,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:35:42,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:35:42,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:42,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147489777] [2025-02-08 06:35:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147489777] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231061331] [2025-02-08 06:35:43,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:43,216 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:43,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:35:43,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:35:43,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:35:43,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:43,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:43,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 06:35:43,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:43,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:43,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:43,404 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 12 [2025-02-08 06:35:43,441 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:35:43,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:35:43,475 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 17 treesize of output 12 [2025-02-08 06:35:43,487 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 17 treesize of output 12 [2025-02-08 06:35:43,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:43,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:43,524 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 17 treesize of output 12 [2025-02-08 06:35:43,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:43,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-02-08 06:35:43,706 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 15 treesize of output 7 [2025-02-08 06:35:43,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:43,830 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2025-02-08 06:35:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:43,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:44,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:44,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2025-02-08 06:35:44,184 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_inspect_before_~shape#1.offset_45| Int)) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| |v_ULTIMATE.start_inspect_before_~shape#1.offset_45|) (< |v_ULTIMATE.start_inspect_before_~shape#1.offset_45| 0) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_inspect_before_~shape#1.offset_45|) 0)) (not (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) |c_ULTIMATE.start_main_~data~0#1.base|)))) is different from false [2025-02-08 06:35:44,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:44,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-02-08 06:35:44,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:44,556 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 33 treesize of output 33 [2025-02-08 06:35:44,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:44,563 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 27 treesize of output 31 [2025-02-08 06:35:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:35:44,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231061331] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:44,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:44,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 15] total 41 [2025-02-08 06:35:44,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284309595] [2025-02-08 06:35:44,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-08 06:35:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:44,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-08 06:35:44,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1456, Unknown=7, NotChecked=76, Total=1640 [2025-02-08 06:35:44,681 INFO L87 Difference]: Start difference. First operand 418 states and 448 transitions. Second operand has 41 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:46,582 INFO L93 Difference]: Finished difference Result 482 states and 516 transitions. [2025-02-08 06:35:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:35:46,582 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 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 67 [2025-02-08 06:35:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:46,583 INFO L225 Difference]: With dead ends: 482 [2025-02-08 06:35:46,583 INFO L226 Difference]: Without dead ends: 482 [2025-02-08 06:35:46,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=355, Invalid=2948, Unknown=7, NotChecked=112, Total=3422 [2025-02-08 06:35:46,584 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1072 mSDsluCounter, 5862 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 6130 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:46,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 6130 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2630 Invalid, 0 Unknown, 277 Unchecked, 1.1s Time] [2025-02-08 06:35:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-08 06:35:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 418. [2025-02-08 06:35:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 338 states have (on average 1.2928994082840237) internal successors, (437), 415 states have internal predecessors, (437), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 447 transitions. [2025-02-08 06:35:46,588 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 447 transitions. Word has length 67 [2025-02-08 06:35:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:46,589 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 447 transitions. [2025-02-08 06:35:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 447 transitions. [2025-02-08 06:35:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 06:35:46,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:46,589 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:46,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:35:46,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-02-08 06:35:46,799 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash 449853647, now seen corresponding path program 1 times [2025-02-08 06:35:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:46,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-02-08 06:35:46,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:46,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:35:46,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:35:46,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:46,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-02-08 06:35:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525627557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388173871] [2025-02-08 06:35:47,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:47,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:47,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:47,501 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:47,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:35:47,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:35:47,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:35:47,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:47,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:47,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-08 06:35:47,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:47,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:47,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:47,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:47,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:47,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:47,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:47,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:47,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:47,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:47,859 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:47,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:35:47,869 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:47,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:35:47,910 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-02-08 06:35:47,911 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 31 treesize of output 38 [2025-02-08 06:35:47,922 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-08 06:35:47,923 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 35 treesize of output 31 [2025-02-08 06:35:48,537 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-08 06:35:48,646 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-02-08 06:35:48,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 25 [2025-02-08 06:35:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:48,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:48,930 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-08 06:35:48,930 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 28 treesize of output 27 [2025-02-08 06:35:49,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:49,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2025-02-08 06:35:49,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:49,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2025-02-08 06:35:49,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:49,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 119 [2025-02-08 06:35:49,874 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 60 treesize of output 54 [2025-02-08 06:35:49,878 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:49,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:49,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 117 [2025-02-08 06:35:49,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:49,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 06:35:49,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:49,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 06:35:49,950 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:49,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-08 06:35:49,954 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:49,956 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 36 treesize of output 26 [2025-02-08 06:35:49,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:49,965 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 36 [2025-02-08 06:35:49,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388173871] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:50,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 55 [2025-02-08 06:35:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026227340] [2025-02-08 06:35:50,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:50,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-08 06:35:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:50,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-08 06:35:50,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2887, Unknown=9, NotChecked=0, Total=3080 [2025-02-08 06:35:50,074 INFO L87 Difference]: Start difference. First operand 418 states and 447 transitions. Second operand has 56 states, 55 states have (on average 3.418181818181818) internal successors, (188), 56 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:53,699 INFO L93 Difference]: Finished difference Result 600 states and 631 transitions. [2025-02-08 06:35:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:35:53,700 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 3.418181818181818) internal successors, (188), 56 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-08 06:35:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:53,701 INFO L225 Difference]: With dead ends: 600 [2025-02-08 06:35:53,701 INFO L226 Difference]: Without dead ends: 600 [2025-02-08 06:35:53,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=647, Invalid=7176, Unknown=9, NotChecked=0, Total=7832 [2025-02-08 06:35:53,702 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 1466 mSDsluCounter, 7663 mSDsCounter, 0 mSdLazyCounter, 4988 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 7927 SdHoareTripleChecker+Invalid, 5039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:53,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 7927 Invalid, 5039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4988 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 06:35:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-08 06:35:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 419. [2025-02-08 06:35:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 339 states have (on average 1.2920353982300885) internal successors, (438), 416 states have internal predecessors, (438), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 448 transitions. [2025-02-08 06:35:53,707 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 448 transitions. Word has length 67 [2025-02-08 06:35:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:53,707 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 448 transitions. [2025-02-08 06:35:53,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 3.418181818181818) internal successors, (188), 56 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 448 transitions. [2025-02-08 06:35:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 06:35:53,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:53,707 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:53,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:35:53,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-08 06:35:53,908 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:35:53,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash 449853648, now seen corresponding path program 1 times [2025-02-08 06:35:53,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:53,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261641342] [2025-02-08 06:35:53,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:53,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:53,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:35:53,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:35:53,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:53,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:54,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:54,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261641342] [2025-02-08 06:35:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261641342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:54,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361850062] [2025-02-08 06:35:54,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:54,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:54,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:54,805 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:54,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:35:54,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:35:54,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:35:54,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:54,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:54,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-08 06:35:54,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:54,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:55,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:55,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:55,074 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:55,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:55,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:55,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:55,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:55,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:55,181 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:55,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:35:55,194 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:55,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:35:55,242 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-02-08 06:35:55,243 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 31 treesize of output 38 [2025-02-08 06:35:55,260 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-08 06:35:55,260 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 35 treesize of output 31 [2025-02-08 06:35:56,058 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-02-08 06:35:56,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 45 [2025-02-08 06:35:56,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-08 06:35:56,088 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-08 06:35:56,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:56,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:56,397 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 67 treesize of output 71 [2025-02-08 06:35:57,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:57,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2025-02-08 06:35:57,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-08 06:35:57,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-08 06:35:57,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:35:57,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:57,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2025-02-08 06:35:57,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:57,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 30 [2025-02-08 06:36:02,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 06:36:02,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 06:36:02,813 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:02,814 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 140 treesize of output 126 [2025-02-08 06:36:02,822 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 140 treesize of output 122 [2025-02-08 06:36:02,829 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 23 treesize of output 21 [2025-02-08 06:36:02,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-02-08 06:36:02,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,855 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 36 treesize of output 44 [2025-02-08 06:36:02,861 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 28 treesize of output 20 [2025-02-08 06:36:02,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 46 [2025-02-08 06:36:02,908 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:02,910 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 68 treesize of output 52 [2025-02-08 06:36:02,916 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:02,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2025-02-08 06:36:02,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2025-02-08 06:36:02,950 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:02,952 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 64 treesize of output 48 [2025-02-08 06:36:02,956 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:02,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2025-02-08 06:36:02,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2025-02-08 06:36:02,980 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:02,982 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 64 treesize of output 48 [2025-02-08 06:36:02,986 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:02,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:02,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2025-02-08 06:36:03,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:03,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 06:36:03,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:03,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-08 06:36:03,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:03,030 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:03,031 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 40 treesize of output 30 [2025-02-08 06:36:03,033 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:03,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-08 06:36:03,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:03,048 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 33 treesize of output 39 [2025-02-08 06:36:03,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:36:03,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:03,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 06:36:03,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:03,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 06:36:03,096 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:03,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-08 06:36:03,102 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:03,105 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 36 treesize of output 26 [2025-02-08 06:36:03,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:03,119 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 36 [2025-02-08 06:36:03,122 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:03,123 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 17 treesize of output 11 [2025-02-08 06:36:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:03,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361850062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:36:03,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:36:03,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 20] total 55 [2025-02-08 06:36:03,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399107479] [2025-02-08 06:36:03,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:36:03,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-08 06:36:03,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:03,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-08 06:36:03,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2887, Unknown=7, NotChecked=0, Total=3080 [2025-02-08 06:36:03,297 INFO L87 Difference]: Start difference. First operand 419 states and 448 transitions. Second operand has 56 states, 55 states have (on average 3.5090909090909093) internal successors, (193), 56 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:09,433 INFO L93 Difference]: Finished difference Result 598 states and 629 transitions. [2025-02-08 06:36:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:36:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 3.5090909090909093) internal successors, (193), 56 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-08 06:36:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:09,434 INFO L225 Difference]: With dead ends: 598 [2025-02-08 06:36:09,434 INFO L226 Difference]: Without dead ends: 598 [2025-02-08 06:36:09,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=633, Invalid=7192, Unknown=7, NotChecked=0, Total=7832 [2025-02-08 06:36:09,436 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1196 mSDsluCounter, 7189 mSDsCounter, 0 mSdLazyCounter, 5129 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 7449 SdHoareTripleChecker+Invalid, 5189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 5129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:09,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 7449 Invalid, 5189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 5129 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 06:36:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-02-08 06:36:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 419. [2025-02-08 06:36:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 339 states have (on average 1.2861356932153392) internal successors, (436), 416 states have internal predecessors, (436), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:36:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 446 transitions. [2025-02-08 06:36:09,442 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 446 transitions. Word has length 67 [2025-02-08 06:36:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:09,442 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 446 transitions. [2025-02-08 06:36:09,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 3.5090909090909093) internal successors, (193), 56 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 446 transitions. [2025-02-08 06:36:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 06:36:09,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:09,442 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:09,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 06:36:09,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:09,643 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:36:09,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash 32660624, now seen corresponding path program 1 times [2025-02-08 06:36:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506733052] [2025-02-08 06:36:09,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:09,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:09,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:36:09,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:36:09,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:09,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506733052] [2025-02-08 06:36:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506733052] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:36:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006201467] [2025-02-08 06:36:10,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:10,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:10,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:36:10,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:36:10,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:36:10,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:36:10,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:36:10,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:10,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:10,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-08 06:36:10,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:36:10,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:36:10,489 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:36:10,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:36:10,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:36:10,522 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 13 [2025-02-08 06:36:10,577 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2025-02-08 06:36:10,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2025-02-08 06:36:10,621 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 26 treesize of output 19 [2025-02-08 06:36:10,634 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 26 treesize of output 19 [2025-02-08 06:36:10,659 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2025-02-08 06:36:10,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2025-02-08 06:36:10,726 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-08 06:36:10,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2025-02-08 06:36:10,780 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:36:10,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 49 [2025-02-08 06:36:10,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:36:11,363 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 15 treesize of output 7 [2025-02-08 06:36:11,989 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-02-08 06:36:11,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 101 [2025-02-08 06:36:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:12,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:36:13,449 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_48| Int) (|v_ULTIMATE.start_inspect_before_~shape#1.offset_54| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_48| 1))) (or (< |v_ULTIMATE.start_inspect_before_~shape#1.offset_54| 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~node~1#1.base|) 1)) (< |c_ULTIMATE.start_main_~data~0#1.offset| |v_ULTIMATE.start_inspect_before_~shape#1.offset_54|) (= (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_1933))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_48| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_48|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_inspect_before_~shape#1.offset_54|)) 1) (not (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) 1))))) is different from false [2025-02-08 06:36:13,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:13,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 51 [2025-02-08 06:36:13,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:13,865 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 430 treesize of output 420 [2025-02-08 06:36:13,873 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 312 treesize of output 304 [2025-02-08 06:36:13,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:13,918 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 223 treesize of output 223 [2025-02-08 06:36:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-08 06:36:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006201467] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:36:15,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:36:15,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 22] total 54 [2025-02-08 06:36:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464311857] [2025-02-08 06:36:15,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:36:15,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-08 06:36:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:15,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-08 06:36:15,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2671, Unknown=3, NotChecked=104, Total=2970 [2025-02-08 06:36:15,679 INFO L87 Difference]: Start difference. First operand 419 states and 446 transitions. Second operand has 55 states, 54 states have (on average 3.537037037037037) internal successors, (191), 55 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:20,623 INFO L93 Difference]: Finished difference Result 479 states and 509 transitions. [2025-02-08 06:36:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:36:20,624 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.537037037037037) internal successors, (191), 55 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-08 06:36:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:20,625 INFO L225 Difference]: With dead ends: 479 [2025-02-08 06:36:20,625 INFO L226 Difference]: Without dead ends: 479 [2025-02-08 06:36:20,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=534, Invalid=4579, Unknown=3, NotChecked=140, Total=5256 [2025-02-08 06:36:20,626 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1025 mSDsluCounter, 5930 mSDsCounter, 0 mSdLazyCounter, 4544 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 6199 SdHoareTripleChecker+Invalid, 4892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:20,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 6199 Invalid, 4892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4544 Invalid, 0 Unknown, 318 Unchecked, 3.4s Time] [2025-02-08 06:36:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-08 06:36:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 420. [2025-02-08 06:36:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 340 states have (on average 1.2882352941176471) internal successors, (438), 417 states have internal predecessors, (438), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:36:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 448 transitions. [2025-02-08 06:36:20,630 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 448 transitions. Word has length 67 [2025-02-08 06:36:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:20,630 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 448 transitions. [2025-02-08 06:36:20,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.537037037037037) internal successors, (191), 55 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 448 transitions. [2025-02-08 06:36:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 06:36:20,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:20,631 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:20,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:36:20,835 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,SelfDestructingSolverStorable41 [2025-02-08 06:36:20,835 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-02-08 06:36:20,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash 32660625, now seen corresponding path program 1 times [2025-02-08 06:36:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:20,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808014646] [2025-02-08 06:36:20,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:20,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:36:20,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:36:20,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:20,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:21,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:21,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808014646] [2025-02-08 06:36:21,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808014646] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:36:21,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132898195] [2025-02-08 06:36:21,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:21,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:21,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:36:21,730 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:36:21,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:36:21,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:36:21,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:36:21,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:21,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:21,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-08 06:36:21,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:36:21,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:36:21,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:36:21,927 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:36:21,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:36:21,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:36:21,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:36:21,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:36:22,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 06:36:22,009 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 42 treesize of output 22 [2025-02-08 06:36:22,085 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-02-08 06:36:22,085 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 28 treesize of output 36 [2025-02-08 06:36:22,094 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 18 treesize of output 13 [2025-02-08 06:36:22,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:36:22,152 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 43 treesize of output 32 [2025-02-08 06:36:22,190 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 43 treesize of output 32 [2025-02-08 06:36:22,194 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 16 treesize of output 11 [2025-02-08 06:36:22,211 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-08 06:36:22,211 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 20 treesize of output 22 [2025-02-08 06:36:22,217 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 18 treesize of output 13 [2025-02-08 06:36:22,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:36:22,272 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 34 treesize of output 25 [2025-02-08 06:36:22,288 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 57 treesize of output 29 [2025-02-08 06:36:22,299 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 15 [2025-02-08 06:36:23,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:23,133 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:23,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:23,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 41 [2025-02-08 06:36:23,145 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 06:36:23,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-02-08 06:36:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:23,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:36:24,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:24,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-02-08 06:36:24,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:24,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2025-02-08 06:36:24,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:24,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21