./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-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 5bf92ba2f935aadbe2c0ae3d366f72b4144ff6b8b5ce7c503e628d249b478be5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:42:54,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:42:54,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:42:54,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:42:54,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:42:54,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:42:54,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:42:54,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:42:54,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:42:54,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:42:54,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:42:54,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:42:54,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:42:54,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:42:54,514 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:42:54,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:42:54,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:42:54,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:42:54,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:42:54,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:42:54,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:42:54,515 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:42:54,515 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:42:54,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:42:54,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:42:54,515 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:42:54,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:42:54,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:42:54,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:42:54,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:42:54,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:42:54,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:42:54,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:42:54,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:42:54,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:42:54,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:42:54,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:42:54,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:42:54,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:42:54,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:42:54,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:42:54,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:42:54,517 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 -> 5bf92ba2f935aadbe2c0ae3d366f72b4144ff6b8b5ce7c503e628d249b478be5 [2025-02-06 10:42:54,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:42:54,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:42:54,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:42:54,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:42:54,758 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:42:54,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-2.i [2025-02-06 10:42:55,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e219b83f/c52c268fad23422f85fef9ac143779d7/FLAG0eb3647bb [2025-02-06 10:42:56,188 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:42:56,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-2.i [2025-02-06 10:42:56,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e219b83f/c52c268fad23422f85fef9ac143779d7/FLAG0eb3647bb [2025-02-06 10:42:56,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e219b83f/c52c268fad23422f85fef9ac143779d7 [2025-02-06 10:42:56,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:42:56,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:42:56,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:42:56,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:42:56,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:42:56,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3986d571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56, skipping insertion in model container [2025-02-06 10:42:56,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:42:56,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:42:56,765 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:42:56,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:42:56,834 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:42:56,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56 WrapperNode [2025-02-06 10:42:56,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:42:56,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:42:56,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:42:56,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:42:56,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,865 INFO L138 Inliner]: procedures = 129, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2025-02-06 10:42:56,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:42:56,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:42:56,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:42:56,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:42:56,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,894 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 6, 5]. 46 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 4 writes are split as follows [0, 3, 1]. [2025-02-06 10:42:56,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:42:56,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:42:56,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:42:56,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:42:56,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (1/1) ... [2025-02-06 10:42:56,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:42:56,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:56,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:42:56,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-06 10:42:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2025-02-06 10:42:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:42:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:42:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:42:56,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:42:57,050 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:42:57,051 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:42:57,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-06 10:42:57,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-06 10:42:57,307 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-06 10:42:57,307 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:42:57,317 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:42:57,317 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:42:57,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:42:57 BoogieIcfgContainer [2025-02-06 10:42:57,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:42:57,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:42:57,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:42:57,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:42:57,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:42:56" (1/3) ... [2025-02-06 10:42:57,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e815172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:42:57, skipping insertion in model container [2025-02-06 10:42:57,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:56" (2/3) ... [2025-02-06 10:42:57,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e815172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:42:57, skipping insertion in model container [2025-02-06 10:42:57,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:42:57" (3/3) ... [2025-02-06 10:42:57,327 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-2.i [2025-02-06 10:42:57,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:42:57,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_nondet_insert-2.i that has 3 procedures, 89 locations, 1 initial locations, 6 loop locations, and 25 error locations. [2025-02-06 10:42:57,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:42:57,369 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;@1505ff93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:42:57,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-06 10:42:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 82 states have internal predecessors, (96), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:42:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:42:57,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:57,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:57,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:42:57,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash -902593135, now seen corresponding path program 1 times [2025-02-06 10:42:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:57,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833378315] [2025-02-06 10:42:57,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:57,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:57,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:42:57,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:42:57,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:57,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:57,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:57,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833378315] [2025-02-06 10:42:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833378315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:57,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:57,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066578898] [2025-02-06 10:42:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:42:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:57,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:42:57,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:42:57,511 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 82 states have internal predecessors, (96), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:42:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:57,521 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2025-02-06 10:42:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:42:57,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-06 10:42:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:57,526 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:42:57,526 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:42:57,527 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-06 10:42:57,528 INFO L435 NwaCegarLoop]: 98 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, 98 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-06 10:42:57,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:42:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:42:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:42:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2025-02-06 10:42:57,554 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 13 [2025-02-06 10:42:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:57,555 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2025-02-06 10:42:57,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:42:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2025-02-06 10:42:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:42:57,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:57,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:57,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:42:57,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:42:57,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1045766290, now seen corresponding path program 1 times [2025-02-06 10:42:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:57,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696306093] [2025-02-06 10:42:57,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:57,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:42:57,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:42:57,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:57,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:57,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:57,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696306093] [2025-02-06 10:42:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696306093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457399533] [2025-02-06 10:42:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:57,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:57,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:57,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:57,669 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:42:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:57,728 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2025-02-06 10:42:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:57,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-06 10:42:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:57,730 INFO L225 Difference]: With dead ends: 80 [2025-02-06 10:42:57,730 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 10:42:57,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:57,732 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:57,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 10:42:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 10:42:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:42:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2025-02-06 10:42:57,739 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 15 [2025-02-06 10:42:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:57,740 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2025-02-06 10:42:57,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:42:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2025-02-06 10:42:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:42:57,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:57,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:57,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:42:57,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:42:57,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1045766289, now seen corresponding path program 1 times [2025-02-06 10:42:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087292605] [2025-02-06 10:42:57,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:57,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:42:57,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:42:57,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:57,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:57,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:57,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087292605] [2025-02-06 10:42:57,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087292605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:57,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:57,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:57,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189463363] [2025-02-06 10:42:57,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:57,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:57,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:57,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:57,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:57,884 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:42:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:57,953 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2025-02-06 10:42:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-06 10:42:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:57,954 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:42:57,954 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:42:57,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:57,955 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:57,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 147 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:42:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-06 10:42:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 74 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:42:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2025-02-06 10:42:57,963 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 15 [2025-02-06 10:42:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:57,963 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2025-02-06 10:42:57,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:42:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2025-02-06 10:42:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:42:57,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:57,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:57,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:42:57,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:42:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash 227477615, now seen corresponding path program 1 times [2025-02-06 10:42:57,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:57,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426694109] [2025-02-06 10:42:57,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:57,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:42:57,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:42:57,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:57,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:42:58,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:58,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426694109] [2025-02-06 10:42:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426694109] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604580853] [2025-02-06 10:42:58,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:58,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:58,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:58,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:58,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:42:58,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:42:58,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:42:58,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:58,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:58,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:42:58,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:58,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:42:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604580853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:42:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-06 10:42:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209719162] [2025-02-06 10:42:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:42:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:58,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:42:58,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:42:58,271 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:42:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:58,330 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-02-06 10:42:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:42:58,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-06 10:42:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:58,332 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:42:58,332 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:42:58,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:42:58,333 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:58,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 458 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:42:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:42:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:42:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2025-02-06 10:42:58,340 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 26 [2025-02-06 10:42:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:58,340 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2025-02-06 10:42:58,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:42:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2025-02-06 10:42:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:42:58,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:58,341 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:58,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:42:58,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:58,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:42:58,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash -949331442, now seen corresponding path program 1 times [2025-02-06 10:42:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:58,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000075667] [2025-02-06 10:42:58,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:58,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:42:58,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:42:58,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:58,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:42:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000075667] [2025-02-06 10:42:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000075667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043274295] [2025-02-06 10:42:58,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:58,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:58,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:58,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:58,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:42:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:42:58,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:42:58,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:58,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:58,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 10:42:58,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:58,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:42:59,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043274295] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:59,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-06 10:42:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671652213] [2025-02-06 10:42:59,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:59,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:42:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:59,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:42:59,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:42:59,002 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:42:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:59,166 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2025-02-06 10:42:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:42:59,167 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2025-02-06 10:42:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:59,169 INFO L225 Difference]: With dead ends: 108 [2025-02-06 10:42:59,169 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 10:42:59,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:42:59,169 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:59,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 720 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 10:42:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2025-02-06 10:42:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:42:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2025-02-06 10:42:59,179 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 31 [2025-02-06 10:42:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:59,179 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2025-02-06 10:42:59,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:42:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2025-02-06 10:42:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:42:59,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:59,182 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] [2025-02-06 10:42:59,188 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-06 10:42:59,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:59,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:42:59,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1179399119, now seen corresponding path program 2 times [2025-02-06 10:42:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29628949] [2025-02-06 10:42:59,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:42:59,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:59,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:42:59,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:42:59,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:42:59,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:42:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29628949] [2025-02-06 10:42:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29628949] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510020511] [2025-02-06 10:42:59,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:42:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:59,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:59,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:59,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:42:59,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:42:59,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:42:59,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:42:59,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:59,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:42:59,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:59,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:42:59,666 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:42:59,666 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-06 10:42:59,686 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:42:59,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:42:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:42:59,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:42:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510020511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:59,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:42:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 10:42:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040247086] [2025-02-06 10:42:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:59,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:42:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:59,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:42:59,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:59,731 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:42:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:59,782 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-02-06 10:42:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:42:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-02-06 10:42:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:59,783 INFO L225 Difference]: With dead ends: 96 [2025-02-06 10:42:59,784 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 10:42:59,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:59,784 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:59,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 73 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 10:42:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2025-02-06 10:42:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 79 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:42:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-02-06 10:42:59,793 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 36 [2025-02-06 10:42:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:59,793 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-02-06 10:42:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:42:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-02-06 10:42:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:42:59,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:59,794 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] [2025-02-06 10:42:59,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:42:59,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:59,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:42:59,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1179399120, now seen corresponding path program 1 times [2025-02-06 10:42:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220839239] [2025-02-06 10:42:59,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:59,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:00,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 10:43:00,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:43:00,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:00,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:43:00,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220839239] [2025-02-06 10:43:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220839239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:00,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383437336] [2025-02-06 10:43:00,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:00,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:00,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:00,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:00,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:43:00,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 10:43:00,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:43:00,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:00,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:00,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 10:43:00,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:00,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:43:00,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:00,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:43:00,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:00,313 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:43:00,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:43:00,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:43:00,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:43:00,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:00,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383437336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:00,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:00,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2025-02-06 10:43:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298293822] [2025-02-06 10:43:00,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:00,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:43:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:00,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:43:00,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:43:00,684 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:00,782 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-02-06 10:43:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:43:00,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2025-02-06 10:43:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:00,783 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:43:00,783 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:43:00,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:43:00,787 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 157 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:00,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 127 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:43:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 10:43:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2025-02-06 10:43:00,795 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 36 [2025-02-06 10:43:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:00,796 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2025-02-06 10:43:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2025-02-06 10:43:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:43:00,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:00,798 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] [2025-02-06 10:43:00,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:43:01,002 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,SelfDestructingSolverStorable6 [2025-02-06 10:43:01,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:01,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1648270650, now seen corresponding path program 1 times [2025-02-06 10:43:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:01,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807105284] [2025-02-06 10:43:01,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:01,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:01,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:43:01,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:43:01,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:01,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:43:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807105284] [2025-02-06 10:43:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807105284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:43:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493721141] [2025-02-06 10:43:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:43:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:01,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:43:01,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:43:01,088 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:01,243 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2025-02-06 10:43:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:43:01,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-02-06 10:43:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:01,244 INFO L225 Difference]: With dead ends: 124 [2025-02-06 10:43:01,244 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 10:43:01,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:43:01,245 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 45 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:01,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 341 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 10:43:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 101. [2025-02-06 10:43:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 95 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2025-02-06 10:43:01,248 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 39 [2025-02-06 10:43:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:01,248 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2025-02-06 10:43:01,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2025-02-06 10:43:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:43:01,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:01,249 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] [2025-02-06 10:43:01,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:43:01,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:01,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1648270649, now seen corresponding path program 1 times [2025-02-06 10:43:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798638398] [2025-02-06 10:43:01,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:01,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:43:01,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:43:01,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:01,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:43:01,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:01,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798638398] [2025-02-06 10:43:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798638398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:01,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:01,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:43:01,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687992411] [2025-02-06 10:43:01,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:01,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:43:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:01,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:43:01,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:43:01,406 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:01,555 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2025-02-06 10:43:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:43:01,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-02-06 10:43:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:01,556 INFO L225 Difference]: With dead ends: 124 [2025-02-06 10:43:01,557 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 10:43:01,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:43:01,557 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:01,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 373 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 10:43:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 101. [2025-02-06 10:43:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 95 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2025-02-06 10:43:01,566 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 39 [2025-02-06 10:43:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:01,567 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2025-02-06 10:43:01,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2025-02-06 10:43:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:43:01,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:01,567 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] [2025-02-06 10:43:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:43:01,567 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 730180010, now seen corresponding path program 1 times [2025-02-06 10:43:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:01,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034077920] [2025-02-06 10:43:01,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:01,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:43:01,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:43:01,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:01,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034077920] [2025-02-06 10:43:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034077920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850391763] [2025-02-06 10:43:01,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:01,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:01,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:01,850 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:01,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:43:01,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:43:01,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:43:01,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:01,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:01,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 10:43:01,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:01,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:01,954 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:43:01,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:43:01,987 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-06 10:43:02,283 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 37 treesize of output 21 [2025-02-06 10:43:02,285 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-06 10:43:02,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:43:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:43:02,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:02,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850391763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:02,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:43:02,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2025-02-06 10:43:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292549017] [2025-02-06 10:43:02,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:02,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 10:43:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:02,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 10:43:02,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:43:02,532 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:03,165 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2025-02-06 10:43:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:43:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2025-02-06 10:43:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:03,167 INFO L225 Difference]: With dead ends: 160 [2025-02-06 10:43:03,167 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:43:03,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:43:03,168 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 95 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:03,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1049 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:43:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:43:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2025-02-06 10:43:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 110 states have internal predecessors, (135), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:43:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2025-02-06 10:43:03,172 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 42 [2025-02-06 10:43:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:03,173 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2025-02-06 10:43:03,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2025-02-06 10:43:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:43:03,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:03,173 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] [2025-02-06 10:43:03,180 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-06 10:43:03,378 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,SelfDestructingSolverStorable9 [2025-02-06 10:43:03,378 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:03,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 730180011, now seen corresponding path program 1 times [2025-02-06 10:43:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:03,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502915575] [2025-02-06 10:43:03,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:03,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:43:03,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:43:03,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:03,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:03,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502915575] [2025-02-06 10:43:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502915575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256050083] [2025-02-06 10:43:03,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:03,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:03,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:03,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:03,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:43:03,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:43:03,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:43:03,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:03,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:03,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 10:43:03,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:03,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:03,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:43:03,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:43:03,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:43:03,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:03,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:03,878 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-06 10:43:04,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2025-02-06 10:43:04,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:43:04,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:43:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:43:04,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:04,461 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 56 treesize of output 40 [2025-02-06 10:43:04,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2025-02-06 10:43:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256050083] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:04,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 36 [2025-02-06 10:43:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365624702] [2025-02-06 10:43:04,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:04,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:43:04,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:04,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:43:04,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1230, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:43:04,762 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:05,472 INFO L93 Difference]: Finished difference Result 162 states and 191 transitions. [2025-02-06 10:43:05,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:43:05,473 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2025-02-06 10:43:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:05,474 INFO L225 Difference]: With dead ends: 162 [2025-02-06 10:43:05,474 INFO L226 Difference]: Without dead ends: 162 [2025-02-06 10:43:05,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=1961, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 10:43:05,475 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 176 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:05,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1120 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:43:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-06 10:43:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 115. [2025-02-06 10:43:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 108 states have internal predecessors, (131), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:43:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2025-02-06 10:43:05,481 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 42 [2025-02-06 10:43:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:05,482 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2025-02-06 10:43:05,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2025-02-06 10:43:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:43:05,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:05,482 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] [2025-02-06 10:43:05,489 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-06 10:43:05,682 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,SelfDestructingSolverStorable10 [2025-02-06 10:43:05,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1013726320, now seen corresponding path program 1 times [2025-02-06 10:43:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:05,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694361948] [2025-02-06 10:43:05,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:05,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:05,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:43:05,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:43:05,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:05,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:43:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694361948] [2025-02-06 10:43:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694361948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:05,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:05,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:43:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232815177] [2025-02-06 10:43:05,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:05,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:43:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:05,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:43:05,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:43:05,751 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:05,822 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2025-02-06 10:43:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:43:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-02-06 10:43:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:05,823 INFO L225 Difference]: With dead ends: 140 [2025-02-06 10:43:05,823 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 10:43:05,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:43:05,823 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:05,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 491 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 10:43:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2025-02-06 10:43:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 109 states have internal predecessors, (131), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:43:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2025-02-06 10:43:05,827 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 43 [2025-02-06 10:43:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:05,827 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2025-02-06 10:43:05,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2025-02-06 10:43:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:43:05,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:05,827 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:43:05,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:43:05,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:05,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:05,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1216657338, now seen corresponding path program 2 times [2025-02-06 10:43:05,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:05,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636801090] [2025-02-06 10:43:05,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:05,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-06 10:43:05,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:43:05,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:05,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636801090] [2025-02-06 10:43:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636801090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492094761] [2025-02-06 10:43:06,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:06,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:06,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:06,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:06,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:43:06,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-06 10:43:06,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:43:06,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:06,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:06,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-06 10:43:06,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:06,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:06,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:06,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:06,464 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:43:06,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:43:06,516 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-06 10:43:06,521 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-06 10:43:06,844 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 65 treesize of output 41 [2025-02-06 10:43:06,853 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-06 10:43:07,062 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:43:07,066 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2025-02-06 10:43:07,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2025-02-06 10:43:07,075 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:43:07,075 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-02-06 10:43:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:43:07,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492094761] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:07,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:43:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2025-02-06 10:43:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388662275] [2025-02-06 10:43:07,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 10:43:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:07,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 10:43:07,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1048, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:43:07,548 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:08,499 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2025-02-06 10:43:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:43:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2025-02-06 10:43:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:08,500 INFO L225 Difference]: With dead ends: 183 [2025-02-06 10:43:08,500 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 10:43:08,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=159, Invalid=1911, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 10:43:08,501 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 124 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:08,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1779 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:43:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 10:43:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 143. [2025-02-06 10:43:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 114 states have (on average 1.4035087719298245) internal successors, (160), 134 states have internal predecessors, (160), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 10:43:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2025-02-06 10:43:08,506 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 45 [2025-02-06 10:43:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:08,507 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2025-02-06 10:43:08,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2025-02-06 10:43:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:43:08,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:08,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:08,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:43:08,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:08,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:08,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1542061024, now seen corresponding path program 1 times [2025-02-06 10:43:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840455013] [2025-02-06 10:43:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:08,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 10:43:08,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:43:08,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:08,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 10:43:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840455013] [2025-02-06 10:43:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840455013] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610258864] [2025-02-06 10:43:08,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:08,793 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:43:08,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 10:43:08,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:43:08,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:08,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:08,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 10:43:08,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:43:08,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:43:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610258864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:08,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:43:08,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-06 10:43:08,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305006621] [2025-02-06 10:43:08,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:08,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:43:08,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:08,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:43:08,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:43:08,924 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:43:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:08,952 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2025-02-06 10:43:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:43:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-02-06 10:43:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:08,954 INFO L225 Difference]: With dead ends: 165 [2025-02-06 10:43:08,955 INFO L226 Difference]: Without dead ends: 165 [2025-02-06 10:43:08,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:43:08,955 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:08,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 367 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:43:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-06 10:43:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2025-02-06 10:43:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 128 states have (on average 1.390625) internal successors, (178), 148 states have internal predecessors, (178), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-06 10:43:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2025-02-06 10:43:08,962 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 47 [2025-02-06 10:43:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:08,962 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2025-02-06 10:43:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:43:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2025-02-06 10:43:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:43:08,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:08,964 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] [2025-02-06 10:43:08,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:43:09,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:09,165 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:09,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash 791310676, now seen corresponding path program 1 times [2025-02-06 10:43:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:09,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305869245] [2025-02-06 10:43:09,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:09,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:43:09,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:43:09,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:09,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:09,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:09,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305869245] [2025-02-06 10:43:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305869245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:09,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487228578] [2025-02-06 10:43:09,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:09,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:09,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:09,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:09,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:43:09,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:43:09,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:43:09,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:09,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:09,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 10:43:09,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:09,448 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-06 10:43:09,584 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-06 10:43:09,587 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 20 treesize of output 12 [2025-02-06 10:43:09,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 10:43:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:43:09,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487228578] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:09,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:43:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2025-02-06 10:43:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475514797] [2025-02-06 10:43:09,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:09,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:43:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:09,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:43:09,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:43:09,743 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:10,056 INFO L93 Difference]: Finished difference Result 203 states and 240 transitions. [2025-02-06 10:43:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:43:10,057 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2025-02-06 10:43:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:10,057 INFO L225 Difference]: With dead ends: 203 [2025-02-06 10:43:10,057 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 10:43:10,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:43:10,058 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 96 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:10,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1315 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:43:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 10:43:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 158. [2025-02-06 10:43:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 147 states have internal predecessors, (175), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-06 10:43:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2025-02-06 10:43:10,065 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 46 [2025-02-06 10:43:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:10,066 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2025-02-06 10:43:10,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2025-02-06 10:43:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:43:10,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:10,066 INFO L218 NwaCegarLoop]: trace histogram [3, 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-06 10:43:10,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 10:43:10,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:10,267 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:10,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:10,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1941398000, now seen corresponding path program 2 times [2025-02-06 10:43:10,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:10,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793887680] [2025-02-06 10:43:10,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:10,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-06 10:43:10,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:43:10,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:10,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 10:43:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793887680] [2025-02-06 10:43:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793887680] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:10,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850958847] [2025-02-06 10:43:10,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:10,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:10,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:10,463 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:10,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:43:10,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-06 10:43:10,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:43:10,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:10,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:10,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:43:10,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:43:10,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:43:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850958847] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:10,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:10,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 33 [2025-02-06 10:43:10,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534952548] [2025-02-06 10:43:10,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:10,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:43:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:10,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:43:10,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:43:10,967 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 29 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:43:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:11,200 INFO L93 Difference]: Finished difference Result 313 states and 393 transitions. [2025-02-06 10:43:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:43:11,201 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 29 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-02-06 10:43:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:11,202 INFO L225 Difference]: With dead ends: 313 [2025-02-06 10:43:11,202 INFO L226 Difference]: Without dead ends: 313 [2025-02-06 10:43:11,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:43:11,202 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 179 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:11,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1466 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:43:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-06 10:43:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 216. [2025-02-06 10:43:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 182 states have (on average 1.3021978021978022) internal successors, (237), 200 states have internal predecessors, (237), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-06 10:43:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2025-02-06 10:43:11,208 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 49 [2025-02-06 10:43:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:11,208 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2025-02-06 10:43:11,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 29 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:43:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2025-02-06 10:43:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:43:11,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:11,209 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:11,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 10:43:11,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 10:43:11,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:11,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:11,413 INFO L85 PathProgramCache]: Analyzing trace with hash -986395616, now seen corresponding path program 1 times [2025-02-06 10:43:11,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123992750] [2025-02-06 10:43:11,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:11,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:43:11,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:11,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:11,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:43:11,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:11,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123992750] [2025-02-06 10:43:11,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123992750] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:11,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113143224] [2025-02-06 10:43:11,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:11,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:11,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:11,578 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:11,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:43:11,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:43:11,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:11,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:11,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:11,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 10:43:11,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:43:11,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:43:12,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113143224] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:12,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:12,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-02-06 10:43:12,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236366951] [2025-02-06 10:43:12,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:12,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:43:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:12,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:43:12,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:43:12,001 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 22 states have internal predecessors, (83), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 10:43:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:12,177 INFO L93 Difference]: Finished difference Result 300 states and 389 transitions. [2025-02-06 10:43:12,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:43:12,177 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 22 states have internal predecessors, (83), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2025-02-06 10:43:12,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:12,178 INFO L225 Difference]: With dead ends: 300 [2025-02-06 10:43:12,178 INFO L226 Difference]: Without dead ends: 300 [2025-02-06 10:43:12,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:43:12,179 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 113 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:12,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 871 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-06 10:43:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 240. [2025-02-06 10:43:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3201970443349753) internal successors, (268), 223 states have internal predecessors, (268), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (22), 12 states have call predecessors, (22), 9 states have call successors, (22) [2025-02-06 10:43:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 299 transitions. [2025-02-06 10:43:12,185 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 299 transitions. Word has length 50 [2025-02-06 10:43:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:12,185 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 299 transitions. [2025-02-06 10:43:12,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 22 states have internal predecessors, (83), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 10:43:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 299 transitions. [2025-02-06 10:43:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:43:12,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:12,186 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:12,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 10:43:12,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 10:43:12,387 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:12,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1830867487, now seen corresponding path program 1 times [2025-02-06 10:43:12,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:12,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129306659] [2025-02-06 10:43:12,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:12,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:43:12,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:12,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:12,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 10:43:12,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129306659] [2025-02-06 10:43:12,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129306659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423763325] [2025-02-06 10:43:12,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:12,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:12,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:12,502 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:12,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:43:12,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:43:12,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:12,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:12,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:43:12,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:12,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:12,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:43:12,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:12,614 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:43:12,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:43:12,673 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:43:12,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:43:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 10:43:12,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:43:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423763325] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:12,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:12,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2025-02-06 10:43:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927650125] [2025-02-06 10:43:12,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:12,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:43:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:12,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:43:12,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:43:12,742 INFO L87 Difference]: Start difference. First operand 240 states and 299 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:43:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:12,828 INFO L93 Difference]: Finished difference Result 251 states and 310 transitions. [2025-02-06 10:43:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:43:12,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2025-02-06 10:43:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:12,830 INFO L225 Difference]: With dead ends: 251 [2025-02-06 10:43:12,830 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 10:43:12,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:43:12,830 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 83 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:12,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 204 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 10:43:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 238. [2025-02-06 10:43:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 221 states have internal predecessors, (265), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (22), 12 states have call predecessors, (22), 9 states have call successors, (22) [2025-02-06 10:43:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 296 transitions. [2025-02-06 10:43:12,840 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 296 transitions. Word has length 50 [2025-02-06 10:43:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:12,840 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 296 transitions. [2025-02-06 10:43:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:43:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 296 transitions. [2025-02-06 10:43:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:43:12,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:12,840 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:12,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 10:43:13,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 10:43:13,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:13,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1830867486, now seen corresponding path program 1 times [2025-02-06 10:43:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:13,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82486632] [2025-02-06 10:43:13,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:13,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:13,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:43:13,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:13,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:13,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:43:13,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:13,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82486632] [2025-02-06 10:43:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82486632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108000867] [2025-02-06 10:43:13,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:13,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:13,223 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:13,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:43:13,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:43:13,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:13,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:13,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:13,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:43:13,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:13,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:43:13,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:43:13,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:13,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:43:13,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:13,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:43:13,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:43:13,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:43:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108000867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:13,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:43:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-02-06 10:43:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942999589] [2025-02-06 10:43:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:13,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:43:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:13,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:43:13,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:43:13,488 INFO L87 Difference]: Start difference. First operand 238 states and 296 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:43:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:13,537 INFO L93 Difference]: Finished difference Result 243 states and 301 transitions. [2025-02-06 10:43:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:43:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-02-06 10:43:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:13,539 INFO L225 Difference]: With dead ends: 243 [2025-02-06 10:43:13,539 INFO L226 Difference]: Without dead ends: 243 [2025-02-06 10:43:13,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:43:13,539 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 107 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:13,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 144 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:43:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-06 10:43:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 233. [2025-02-06 10:43:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 200 states have (on average 1.285) internal successors, (257), 216 states have internal predecessors, (257), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (20), 12 states have call predecessors, (20), 9 states have call successors, (20) [2025-02-06 10:43:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 286 transitions. [2025-02-06 10:43:13,548 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 286 transitions. Word has length 50 [2025-02-06 10:43:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:13,548 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 286 transitions. [2025-02-06 10:43:13,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:43:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 286 transitions. [2025-02-06 10:43:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:43:13,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:13,549 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:43:13,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 10:43:13,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:13,749 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:13,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash 55211940, now seen corresponding path program 1 times [2025-02-06 10:43:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:13,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984044865] [2025-02-06 10:43:13,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:13,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:43:13,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:13,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:13,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 10:43:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984044865] [2025-02-06 10:43:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984044865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:13,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:43:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541750677] [2025-02-06 10:43:13,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:13,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:43:13,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:13,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:43:13,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:43:13,814 INFO L87 Difference]: Start difference. First operand 233 states and 286 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:13,931 INFO L93 Difference]: Finished difference Result 254 states and 304 transitions. [2025-02-06 10:43:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:43:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-02-06 10:43:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:13,933 INFO L225 Difference]: With dead ends: 254 [2025-02-06 10:43:13,933 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 10:43:13,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:43:13,933 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 34 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:13,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 307 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 10:43:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2025-02-06 10:43:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 224 states have internal predecessors, (271), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (20), 12 states have call predecessors, (20), 9 states have call successors, (20) [2025-02-06 10:43:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 300 transitions. [2025-02-06 10:43:13,938 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 300 transitions. Word has length 50 [2025-02-06 10:43:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:13,938 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 300 transitions. [2025-02-06 10:43:13,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2025-02-06 10:43:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:43:13,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:13,939 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:43:13,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:43:13,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:13,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash 55211941, now seen corresponding path program 1 times [2025-02-06 10:43:13,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:13,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837768226] [2025-02-06 10:43:13,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:13,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:13,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:43:13,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:13,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:13,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:43:14,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:14,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837768226] [2025-02-06 10:43:14,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837768226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:14,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:14,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:43:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183106276] [2025-02-06 10:43:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:14,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:43:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:14,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:43:14,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:43:14,054 INFO L87 Difference]: Start difference. First operand 241 states and 300 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:14,180 INFO L93 Difference]: Finished difference Result 256 states and 305 transitions. [2025-02-06 10:43:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:43:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-02-06 10:43:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:14,182 INFO L225 Difference]: With dead ends: 256 [2025-02-06 10:43:14,182 INFO L226 Difference]: Without dead ends: 256 [2025-02-06 10:43:14,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:43:14,183 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:14,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 339 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-06 10:43:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 243. [2025-02-06 10:43:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.2890995260663507) internal successors, (272), 226 states have internal predecessors, (272), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (20), 12 states have call predecessors, (20), 9 states have call successors, (20) [2025-02-06 10:43:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 301 transitions. [2025-02-06 10:43:14,189 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 301 transitions. Word has length 50 [2025-02-06 10:43:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:14,189 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 301 transitions. [2025-02-06 10:43:14,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 301 transitions. [2025-02-06 10:43:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:43:14,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:14,191 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:14,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:43:14,191 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:14,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash -736592825, now seen corresponding path program 3 times [2025-02-06 10:43:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:14,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882412812] [2025-02-06 10:43:14,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:43:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:14,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-02-06 10:43:14,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:14,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 10:43:14,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:43:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:14,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882412812] [2025-02-06 10:43:14,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882412812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:14,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093112309] [2025-02-06 10:43:14,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:43:14,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:14,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:14,315 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:14,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:43:14,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-02-06 10:43:14,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:43:14,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 10:43:14,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:14,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 10:43:14,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:14,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:43:14,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093112309] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:14,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:14,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-06 10:43:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717326463] [2025-02-06 10:43:14,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:14,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:43:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:14,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:43:14,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:43:14,556 INFO L87 Difference]: Start difference. First operand 243 states and 301 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:43:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:14,608 INFO L93 Difference]: Finished difference Result 228 states and 283 transitions. [2025-02-06 10:43:14,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:43:14,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2025-02-06 10:43:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:14,612 INFO L225 Difference]: With dead ends: 228 [2025-02-06 10:43:14,612 INFO L226 Difference]: Without dead ends: 228 [2025-02-06 10:43:14,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:43:14,613 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:14,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 591 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:43:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-06 10:43:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 215. [2025-02-06 10:43:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 200 states have internal predecessors, (239), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-02-06 10:43:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 263 transitions. [2025-02-06 10:43:14,620 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 263 transitions. Word has length 50 [2025-02-06 10:43:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:14,620 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 263 transitions. [2025-02-06 10:43:14,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:43:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 263 transitions. [2025-02-06 10:43:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 10:43:14,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:14,621 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:43:14,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 10:43:14,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-06 10:43:14,823 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:14,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1711570838, now seen corresponding path program 1 times [2025-02-06 10:43:14,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:14,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270220779] [2025-02-06 10:43:14,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:14,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:43:14,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:43:14,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:14,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:43:14,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270220779] [2025-02-06 10:43:14,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270220779] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137383190] [2025-02-06 10:43:14,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:14,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:14,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:14,932 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:14,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:43:15,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:43:15,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:43:15,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:15,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:15,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 10:43:15,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:15,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 10:43:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:15,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:43:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137383190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:15,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:43:15,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 16 [2025-02-06 10:43:15,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968551293] [2025-02-06 10:43:15,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:15,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:43:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:15,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:43:15,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:43:15,126 INFO L87 Difference]: Start difference. First operand 215 states and 263 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:19,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:43:23,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:43:27,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:43:31,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:43:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:31,257 INFO L93 Difference]: Finished difference Result 250 states and 290 transitions. [2025-02-06 10:43:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:43:31,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-02-06 10:43:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:31,260 INFO L225 Difference]: With dead ends: 250 [2025-02-06 10:43:31,261 INFO L226 Difference]: Without dead ends: 250 [2025-02-06 10:43:31,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:43:31,261 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 59 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:31,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 604 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-02-06 10:43:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-06 10:43:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 222. [2025-02-06 10:43:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 191 states have (on average 1.287958115183246) internal successors, (246), 206 states have internal predecessors, (246), 8 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-02-06 10:43:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 270 transitions. [2025-02-06 10:43:31,270 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 270 transitions. Word has length 51 [2025-02-06 10:43:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:31,270 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 270 transitions. [2025-02-06 10:43:31,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2025-02-06 10:43:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:43:31,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:31,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-06 10:43:31,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:43:31,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:31,472 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1725404202, now seen corresponding path program 1 times [2025-02-06 10:43:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:31,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899051145] [2025-02-06 10:43:31,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:31,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:43:31,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:43:31,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:31,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:43:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899051145] [2025-02-06 10:43:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899051145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657677271] [2025-02-06 10:43:31,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:31,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:31,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:31,575 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:31,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:43:31,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:43:31,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:43:31,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:31,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:31,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:43:31,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:43:31,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:43:31,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657677271] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:31,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:31,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-02-06 10:43:31,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893509712] [2025-02-06 10:43:31,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:31,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:43:31,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:31,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:43:31,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:43:31,824 INFO L87 Difference]: Start difference. First operand 222 states and 270 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:43:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:31,928 INFO L93 Difference]: Finished difference Result 218 states and 265 transitions. [2025-02-06 10:43:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:43:31,928 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2025-02-06 10:43:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:31,929 INFO L225 Difference]: With dead ends: 218 [2025-02-06 10:43:31,929 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 10:43:31,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:43:31,929 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 19 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:31,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 914 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 10:43:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2025-02-06 10:43:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 192 states have internal predecessors, (229), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-06 10:43:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 249 transitions. [2025-02-06 10:43:31,933 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 249 transitions. Word has length 52 [2025-02-06 10:43:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:31,933 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 249 transitions. [2025-02-06 10:43:31,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:43:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 249 transitions. [2025-02-06 10:43:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:43:31,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:31,934 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:43:31,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-06 10:43:32,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:32,139 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:32,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -153566915, now seen corresponding path program 1 times [2025-02-06 10:43:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466531058] [2025-02-06 10:43:32,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:32,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:43:32,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:43:32,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:32,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:43:32,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:32,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466531058] [2025-02-06 10:43:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466531058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:32,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:32,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:43:32,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228728229] [2025-02-06 10:43:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:32,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:43:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:32,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:43:32,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:43:32,223 INFO L87 Difference]: Start difference. First operand 206 states and 249 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:32,312 INFO L93 Difference]: Finished difference Result 220 states and 254 transitions. [2025-02-06 10:43:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:43:32,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2025-02-06 10:43:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:32,313 INFO L225 Difference]: With dead ends: 220 [2025-02-06 10:43:32,314 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 10:43:32,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:43:32,314 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:32,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 397 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 10:43:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 207. [2025-02-06 10:43:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 177 states have (on average 1.2994350282485876) internal successors, (230), 193 states have internal predecessors, (230), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-06 10:43:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2025-02-06 10:43:32,318 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 53 [2025-02-06 10:43:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:32,318 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2025-02-06 10:43:32,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:43:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2025-02-06 10:43:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:43:32,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:32,319 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:32,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 10:43:32,319 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:32,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1845835306, now seen corresponding path program 1 times [2025-02-06 10:43:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:32,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296680721] [2025-02-06 10:43:32,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:32,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:32,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:43:32,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:43:32,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:32,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 10:43:32,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296680721] [2025-02-06 10:43:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296680721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:32,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:43:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455181539] [2025-02-06 10:43:32,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:32,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:43:32,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:32,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:43:32,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:43:32,354 INFO L87 Difference]: Start difference. First operand 207 states and 250 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:43:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:32,383 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2025-02-06 10:43:32,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:43:32,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-02-06 10:43:32,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:32,385 INFO L225 Difference]: With dead ends: 206 [2025-02-06 10:43:32,385 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 10:43:32,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:43:32,385 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:32,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 112 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:43:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 10:43:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-02-06 10:43:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 192 states have internal predecessors, (228), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-06 10:43:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 248 transitions. [2025-02-06 10:43:32,390 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 248 transitions. Word has length 54 [2025-02-06 10:43:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:32,390 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 248 transitions. [2025-02-06 10:43:32,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:43:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2025-02-06 10:43:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:43:32,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:32,391 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:32,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:43:32,391 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:32,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1845835305, now seen corresponding path program 1 times [2025-02-06 10:43:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234882938] [2025-02-06 10:43:32,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:32,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:43:32,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:43:32,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:32,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 10:43:32,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234882938] [2025-02-06 10:43:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234882938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:43:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580891699] [2025-02-06 10:43:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:32,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:43:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:32,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:43:32,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:43:32,437 INFO L87 Difference]: Start difference. First operand 206 states and 248 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:43:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:32,457 INFO L93 Difference]: Finished difference Result 205 states and 246 transitions. [2025-02-06 10:43:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:43:32,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-02-06 10:43:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:32,459 INFO L225 Difference]: With dead ends: 205 [2025-02-06 10:43:32,459 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 10:43:32,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:43:32,460 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:32,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 116 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:43:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 10:43:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 10:43:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 177 states have (on average 1.2768361581920904) internal successors, (226), 191 states have internal predecessors, (226), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-06 10:43:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 246 transitions. [2025-02-06 10:43:32,463 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 246 transitions. Word has length 54 [2025-02-06 10:43:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:32,464 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 246 transitions. [2025-02-06 10:43:32,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:43:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2025-02-06 10:43:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:43:32,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:32,464 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:32,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 10:43:32,464 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:32,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1845835271, now seen corresponding path program 1 times [2025-02-06 10:43:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:32,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594106483] [2025-02-06 10:43:32,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:32,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:43:32,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:43:32,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:32,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:43:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594106483] [2025-02-06 10:43:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594106483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:43:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384319029] [2025-02-06 10:43:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:32,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:43:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:32,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:43:32,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:43:32,527 INFO L87 Difference]: Start difference. First operand 205 states and 246 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:43:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:32,561 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2025-02-06 10:43:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:43:32,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-02-06 10:43:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:32,562 INFO L225 Difference]: With dead ends: 231 [2025-02-06 10:43:32,562 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 10:43:32,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:43:32,563 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:32,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:43:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 10:43:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-06 10:43:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 201 states have (on average 1.263681592039801) internal successors, (254), 215 states have internal predecessors, (254), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 10 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-06 10:43:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 276 transitions. [2025-02-06 10:43:32,568 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 276 transitions. Word has length 54 [2025-02-06 10:43:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:32,568 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 276 transitions. [2025-02-06 10:43:32,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:43:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2025-02-06 10:43:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:43:32,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:32,569 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:32,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 10:43:32,569 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:32,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1157534029, now seen corresponding path program 1 times [2025-02-06 10:43:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661551573] [2025-02-06 10:43:32,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:32,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:43:32,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:43:32,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:32,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:43:32,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661551573] [2025-02-06 10:43:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661551573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108743469] [2025-02-06 10:43:32,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:32,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:32,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:32,934 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:32,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:43:33,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:43:33,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:43:33,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:33,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:33,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-06 10:43:33,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:33,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:33,059 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:43:33,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:43:33,086 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-06 10:43:33,156 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2025-02-06 10:43:33,156 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-06 10:43:33,195 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 41 treesize of output 21 [2025-02-06 10:43:33,202 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-06 10:43:33,520 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 69 treesize of output 45 [2025-02-06 10:43:33,608 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-06 10:43:33,719 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:43:33,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 25 [2025-02-06 10:43:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:43:33,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108743469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:34,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:43:34,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2025-02-06 10:43:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320092561] [2025-02-06 10:43:34,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:34,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:43:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:34,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:43:34,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1237, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:43:34,129 INFO L87 Difference]: Start difference. First operand 231 states and 276 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:35,238 INFO L93 Difference]: Finished difference Result 276 states and 325 transitions. [2025-02-06 10:43:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:43:35,239 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 53 [2025-02-06 10:43:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:35,240 INFO L225 Difference]: With dead ends: 276 [2025-02-06 10:43:35,240 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 10:43:35,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=2235, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:43:35,241 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 86 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:35,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2000 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:43:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 10:43:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 236. [2025-02-06 10:43:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 206 states have (on average 1.266990291262136) internal successors, (261), 220 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 10 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-06 10:43:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2025-02-06 10:43:35,251 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 53 [2025-02-06 10:43:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:35,251 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2025-02-06 10:43:35,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2025-02-06 10:43:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:43:35,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:35,252 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:35,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-06 10:43:35,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 10:43:35,456 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:35,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:35,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1157534030, now seen corresponding path program 1 times [2025-02-06 10:43:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:35,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049813118] [2025-02-06 10:43:35,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:35,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:43:35,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:43:35,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:35,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:43:35,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:35,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049813118] [2025-02-06 10:43:35,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049813118] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:35,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862909500] [2025-02-06 10:43:35,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:35,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:35,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:35,957 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:35,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:43:36,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:43:36,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:43:36,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:36,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:36,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-06 10:43:36,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:36,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:36,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:43:36,152 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:43:36,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:43:36,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:36,203 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-06 10:43:36,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:36,294 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-06 10:43:36,294 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-06 10:43:36,301 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-06 10:43:36,349 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-06 10:43:36,358 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-06 10:43:36,765 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 95 treesize of output 63 [2025-02-06 10:43:37,006 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:43:37,015 INFO L349 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2025-02-06 10:43:37,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 41 [2025-02-06 10:43:37,025 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:43:37,025 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-06 10:43:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:43:37,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:37,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862909500] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:37,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:43:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2025-02-06 10:43:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53993827] [2025-02-06 10:43:37,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:43:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:37,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:43:37,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1705, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 10:43:37,564 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand has 36 states, 35 states have (on average 2.2) internal successors, (77), 36 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:39,105 INFO L93 Difference]: Finished difference Result 288 states and 336 transitions. [2025-02-06 10:43:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:43:39,106 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2) internal successors, (77), 36 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 53 [2025-02-06 10:43:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:39,106 INFO L225 Difference]: With dead ends: 288 [2025-02-06 10:43:39,106 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 10:43:39,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=248, Invalid=3058, Unknown=0, NotChecked=0, Total=3306 [2025-02-06 10:43:39,108 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 133 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:39,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 2757 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 10:43:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 10:43:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 235. [2025-02-06 10:43:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 205 states have (on average 1.2634146341463415) internal successors, (259), 219 states have internal predecessors, (259), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 10 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-06 10:43:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2025-02-06 10:43:39,112 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 53 [2025-02-06 10:43:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:39,112 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2025-02-06 10:43:39,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2) internal successors, (77), 36 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2025-02-06 10:43:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:43:39,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:39,113 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:39,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:43:39,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:39,313 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:39,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash -26234704, now seen corresponding path program 1 times [2025-02-06 10:43:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:39,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379190911] [2025-02-06 10:43:39,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:39,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:43:39,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:39,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:39,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 10:43:39,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379190911] [2025-02-06 10:43:39,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379190911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:39,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:39,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:43:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821081580] [2025-02-06 10:43:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:39,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:43:39,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:39,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:43:39,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:43:39,344 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:43:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:39,355 INFO L93 Difference]: Finished difference Result 243 states and 291 transitions. [2025-02-06 10:43:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:43:39,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-02-06 10:43:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:39,356 INFO L225 Difference]: With dead ends: 243 [2025-02-06 10:43:39,356 INFO L226 Difference]: Without dead ends: 243 [2025-02-06 10:43:39,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:43:39,357 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:39,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:43:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-06 10:43:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2025-02-06 10:43:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.2745098039215685) internal successors, (260), 219 states have internal predecessors, (260), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-06 10:43:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 282 transitions. [2025-02-06 10:43:39,362 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 282 transitions. Word has length 56 [2025-02-06 10:43:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 282 transitions. [2025-02-06 10:43:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:43:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 282 transitions. [2025-02-06 10:43:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:43:39,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:39,362 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] [2025-02-06 10:43:39,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 10:43:39,363 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:39,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -771797187, now seen corresponding path program 1 times [2025-02-06 10:43:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129937743] [2025-02-06 10:43:39,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:39,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:43:39,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:39,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:39,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:39,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129937743] [2025-02-06 10:43:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129937743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960647220] [2025-02-06 10:43:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:39,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:39,666 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:39,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:43:39,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:43:39,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:39,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:39,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:39,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 10:43:39,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:39,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:39,780 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:43:39,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:43:39,797 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-06 10:43:39,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:43:40,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-02-06 10:43:40,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:43:40,094 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 25 treesize of output 21 [2025-02-06 10:43:40,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:43:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:43:40,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:40,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:43:40,282 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 37 treesize of output 41 [2025-02-06 10:43:40,386 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 49 treesize of output 29 [2025-02-06 10:43:40,387 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 25 [2025-02-06 10:43:40,468 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 10 treesize of output 8 [2025-02-06 10:43:40,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 10:43:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960647220] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:40,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:40,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 43 [2025-02-06 10:43:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146325565] [2025-02-06 10:43:40,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:40,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-06 10:43:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:40,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-06 10:43:40,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1780, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:43:40,520 INFO L87 Difference]: Start difference. First operand 234 states and 282 transitions. Second operand has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 44 states have internal predecessors, (103), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:41,301 INFO L93 Difference]: Finished difference Result 291 states and 344 transitions. [2025-02-06 10:43:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:43:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 44 states have internal predecessors, (103), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-02-06 10:43:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:41,303 INFO L225 Difference]: With dead ends: 291 [2025-02-06 10:43:41,303 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 10:43:41,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=234, Invalid=3188, Unknown=0, NotChecked=0, Total=3422 [2025-02-06 10:43:41,304 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 99 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:41,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1833 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:43:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 10:43:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 250. [2025-02-06 10:43:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 220 states have (on average 1.2818181818181817) internal successors, (282), 235 states have internal predecessors, (282), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-06 10:43:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 304 transitions. [2025-02-06 10:43:41,309 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 304 transitions. Word has length 56 [2025-02-06 10:43:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:41,309 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 304 transitions. [2025-02-06 10:43:41,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 44 states have internal predecessors, (103), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 304 transitions. [2025-02-06 10:43:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:43:41,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:41,310 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] [2025-02-06 10:43:41,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-06 10:43:41,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:41,511 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash -771797186, now seen corresponding path program 1 times [2025-02-06 10:43:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773895611] [2025-02-06 10:43:41,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:41,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:43:41,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:41,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:41,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:41,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:41,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773895611] [2025-02-06 10:43:41,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773895611] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:41,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043719007] [2025-02-06 10:43:41,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:41,806 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:41,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:43:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:43:41,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:41,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:41,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:41,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:43:41,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:41,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:41,954 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-06 10:43:42,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:43:42,224 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 32 treesize of output 20 [2025-02-06 10:43:42,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:43:42,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-02-06 10:43:42,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:43:42,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:43:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:43:42,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:42,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:43:42,576 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 43 treesize of output 47 [2025-02-06 10:43:42,778 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 67 treesize of output 43 [2025-02-06 10:43:42,780 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 47 treesize of output 35 [2025-02-06 10:43:42,892 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 10 treesize of output 8 [2025-02-06 10:43:42,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 10:43:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:43:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043719007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:42,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:42,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 19] total 50 [2025-02-06 10:43:42,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513332784] [2025-02-06 10:43:42,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:42,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-06 10:43:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:42,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-06 10:43:42,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2409, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 10:43:42,978 INFO L87 Difference]: Start difference. First operand 250 states and 304 transitions. Second operand has 51 states, 50 states have (on average 2.3) internal successors, (115), 51 states have internal predecessors, (115), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:43,880 INFO L93 Difference]: Finished difference Result 293 states and 345 transitions. [2025-02-06 10:43:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:43:43,880 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.3) internal successors, (115), 51 states have internal predecessors, (115), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-02-06 10:43:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:43,881 INFO L225 Difference]: With dead ends: 293 [2025-02-06 10:43:43,881 INFO L226 Difference]: Without dead ends: 293 [2025-02-06 10:43:43,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=3779, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 10:43:43,882 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 185 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:43,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 2071 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:43:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-06 10:43:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 252. [2025-02-06 10:43:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 222 states have (on average 1.2747747747747749) internal successors, (283), 237 states have internal predecessors, (283), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-06 10:43:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 305 transitions. [2025-02-06 10:43:43,891 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 305 transitions. Word has length 56 [2025-02-06 10:43:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:43,891 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 305 transitions. [2025-02-06 10:43:43,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.3) internal successors, (115), 51 states have internal predecessors, (115), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:43:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 305 transitions. [2025-02-06 10:43:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:43:43,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:43,892 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:43,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-06 10:43:44,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:44,093 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:44,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash -655044287, now seen corresponding path program 2 times [2025-02-06 10:43:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213769971] [2025-02-06 10:43:44,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:44,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:44,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-06 10:43:44,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:43:44,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:44,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 10:43:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213769971] [2025-02-06 10:43:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213769971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:43:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079217171] [2025-02-06 10:43:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:43:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:44,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:43:44,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:43:44,199 INFO L87 Difference]: Start difference. First operand 252 states and 305 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:43:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:44,351 INFO L93 Difference]: Finished difference Result 273 states and 320 transitions. [2025-02-06 10:43:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:43:44,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2025-02-06 10:43:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:44,353 INFO L225 Difference]: With dead ends: 273 [2025-02-06 10:43:44,353 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 10:43:44,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:43:44,353 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 62 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:44,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 410 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 10:43:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 253. [2025-02-06 10:43:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 223 states have (on average 1.2780269058295963) internal successors, (285), 238 states have internal predecessors, (285), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-06 10:43:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2025-02-06 10:43:44,359 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 57 [2025-02-06 10:43:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:44,359 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2025-02-06 10:43:44,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:43:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2025-02-06 10:43:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:43:44,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:44,360 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:44,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 10:43:44,360 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:44,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash -655044286, now seen corresponding path program 1 times [2025-02-06 10:43:44,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:44,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448982400] [2025-02-06 10:43:44,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:44,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:44,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:43:44,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:43:44,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:44,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:43:44,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448982400] [2025-02-06 10:43:44,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448982400] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63709560] [2025-02-06 10:43:44,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:44,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:44,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:44,493 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:44,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:43:44,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:43:44,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:43:44,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:44,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:44,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:43:44,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:43:44,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:43:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63709560] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:44,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-06 10:43:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432077989] [2025-02-06 10:43:44,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:43:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:44,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:43:44,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:43:44,912 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 25 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 10:43:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:45,085 INFO L93 Difference]: Finished difference Result 372 states and 464 transitions. [2025-02-06 10:43:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:43:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 25 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 57 [2025-02-06 10:43:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:45,087 INFO L225 Difference]: With dead ends: 372 [2025-02-06 10:43:45,087 INFO L226 Difference]: Without dead ends: 366 [2025-02-06 10:43:45,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:43:45,088 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 130 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:45,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1099 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:43:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-06 10:43:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 247. [2025-02-06 10:43:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.261467889908257) internal successors, (275), 232 states have internal predecessors, (275), 7 states have call successors, (7), 5 states have call predecessors, (7), 10 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-06 10:43:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 296 transitions. [2025-02-06 10:43:45,093 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 296 transitions. Word has length 57 [2025-02-06 10:43:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:45,093 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 296 transitions. [2025-02-06 10:43:45,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 25 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 10:43:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 296 transitions. [2025-02-06 10:43:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:43:45,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:45,094 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:45,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-06 10:43:45,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-06 10:43:45,295 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:45,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -948447293, now seen corresponding path program 2 times [2025-02-06 10:43:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270317064] [2025-02-06 10:43:45,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:45,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-06 10:43:45,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:43:45,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:45,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 10:43:45,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:45,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270317064] [2025-02-06 10:43:45,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270317064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:43:45,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:43:45,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:43:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462987302] [2025-02-06 10:43:45,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:43:45,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:43:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:45,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:43:45,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:43:45,460 INFO L87 Difference]: Start difference. First operand 247 states and 296 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:43:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:45,664 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2025-02-06 10:43:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:43:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2025-02-06 10:43:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:45,665 INFO L225 Difference]: With dead ends: 267 [2025-02-06 10:43:45,665 INFO L226 Difference]: Without dead ends: 267 [2025-02-06 10:43:45,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:43:45,666 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 61 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:45,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 449 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:43:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-06 10:43:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 247. [2025-02-06 10:43:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.2568807339449541) internal successors, (274), 232 states have internal predecessors, (274), 7 states have call successors, (7), 5 states have call predecessors, (7), 10 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-06 10:43:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 295 transitions. [2025-02-06 10:43:45,669 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 295 transitions. Word has length 57 [2025-02-06 10:43:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:45,669 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 295 transitions. [2025-02-06 10:43:45,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:43:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 295 transitions. [2025-02-06 10:43:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:43:45,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:45,670 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:45,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 10:43:45,670 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:45,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -196142653, now seen corresponding path program 2 times [2025-02-06 10:43:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:45,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420652564] [2025-02-06 10:43:45,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:45,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:45,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-06 10:43:45,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:45,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:45,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:43:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420652564] [2025-02-06 10:43:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420652564] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270899966] [2025-02-06 10:43:46,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:46,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:46,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:46,374 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:46,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 10:43:46,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-06 10:43:46,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:46,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:46,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:46,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-06 10:43:46,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:46,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:46,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:46,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:46,544 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:43:46,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:43:46,587 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-02-06 10:43:46,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 10:43:46,601 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-06 10:43:46,601 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 27 treesize of output 23 [2025-02-06 10:43:46,698 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-02-06 10:43:46,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-02-06 10:43:46,770 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-02-06 10:43:46,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 44 [2025-02-06 10:43:46,782 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-06 10:43:46,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2025-02-06 10:43:47,312 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 116 treesize of output 80 [2025-02-06 10:43:47,323 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-06 10:43:48,200 INFO L349 Elim1Store]: treesize reduction 184, result has 36.3 percent of original size [2025-02-06 10:43:48,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 198 treesize of output 219 [2025-02-06 10:43:48,352 INFO L349 Elim1Store]: treesize reduction 188, result has 34.9 percent of original size [2025-02-06 10:43:48,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 170 [2025-02-06 10:43:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:43:49,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:49,983 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2025-02-06 10:43:49,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2025-02-06 10:43:50,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270899966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:50,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:43:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2025-02-06 10:43:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096043806] [2025-02-06 10:43:50,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:50,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 10:43:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:50,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 10:43:50,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2053, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 10:43:50,636 INFO L87 Difference]: Start difference. First operand 247 states and 295 transitions. Second operand has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 42 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:52,585 INFO L93 Difference]: Finished difference Result 347 states and 410 transitions. [2025-02-06 10:43:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:43:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 42 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-02-06 10:43:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:52,587 INFO L225 Difference]: With dead ends: 347 [2025-02-06 10:43:52,587 INFO L226 Difference]: Without dead ends: 347 [2025-02-06 10:43:52,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=235, Invalid=3797, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 10:43:52,588 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 150 mSDsluCounter, 3220 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:52,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 3335 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:43:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-06 10:43:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 286. [2025-02-06 10:43:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 253 states have (on average 1.256916996047431) internal successors, (318), 268 states have internal predecessors, (318), 9 states have call successors, (9), 6 states have call predecessors, (9), 12 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-06 10:43:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 345 transitions. [2025-02-06 10:43:52,593 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 345 transitions. Word has length 56 [2025-02-06 10:43:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:52,593 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 345 transitions. [2025-02-06 10:43:52,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 42 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 345 transitions. [2025-02-06 10:43:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:43:52,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:52,594 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:43:52,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-02-06 10:43:52,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-06 10:43:52,795 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:52,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash -196142652, now seen corresponding path program 2 times [2025-02-06 10:43:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098426847] [2025-02-06 10:43:52,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:52,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-06 10:43:52,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:52,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:52,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:43:53,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:53,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098426847] [2025-02-06 10:43:53,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098426847] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:53,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678836501] [2025-02-06 10:43:53,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:43:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:53,578 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:53,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-06 10:43:53,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-06 10:43:53,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:43:53,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:43:53,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:53,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-02-06 10:43:53,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:53,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:43:53,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:53,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:43:53,754 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:43:53,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:43:53,800 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 22 [2025-02-06 10:43:53,810 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-06 10:43:53,905 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-06 10:43:53,905 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-06 10:43:53,971 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-02-06 10:43:53,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 44 [2025-02-06 10:43:53,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-02-06 10:43:54,390 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 116 treesize of output 80 [2025-02-06 10:43:54,392 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-06 10:43:54,918 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:43:54,934 INFO L349 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2025-02-06 10:43:54,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 66 [2025-02-06 10:43:54,949 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-02-06 10:43:54,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 25 [2025-02-06 10:43:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:43:55,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678836501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:55,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:43:55,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2025-02-06 10:43:55,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877690188] [2025-02-06 10:43:55,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:55,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-06 10:43:55,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:55,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-06 10:43:55,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=2144, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 10:43:55,693 INFO L87 Difference]: Start difference. First operand 286 states and 345 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:43:57,729 INFO L93 Difference]: Finished difference Result 341 states and 401 transitions. [2025-02-06 10:43:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:43:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-02-06 10:43:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:43:57,730 INFO L225 Difference]: With dead ends: 341 [2025-02-06 10:43:57,730 INFO L226 Difference]: Without dead ends: 341 [2025-02-06 10:43:57,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=228, Invalid=3804, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 10:43:57,731 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 87 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 3415 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:43:57,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 3415 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 10:43:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-06 10:43:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 285. [2025-02-06 10:43:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 252 states have (on average 1.25) internal successors, (315), 267 states have internal predecessors, (315), 9 states have call successors, (9), 6 states have call predecessors, (9), 12 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-06 10:43:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 342 transitions. [2025-02-06 10:43:57,735 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 342 transitions. Word has length 56 [2025-02-06 10:43:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:43:57,736 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 342 transitions. [2025-02-06 10:43:57,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:43:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 342 transitions. [2025-02-06 10:43:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:43:57,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:43:57,736 INFO L218 NwaCegarLoop]: trace histogram [3, 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-06 10:43:57,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-06 10:43:57,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-06 10:43:57,937 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:43:57,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:43:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1844091677, now seen corresponding path program 1 times [2025-02-06 10:43:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:43:57,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989096481] [2025-02-06 10:43:57,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:43:57,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:43:57,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:43:57,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:57,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:43:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:43:58,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989096481] [2025-02-06 10:43:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989096481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:43:58,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189106397] [2025-02-06 10:43:58,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:43:58,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:43:58,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:43:58,071 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:43:58,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-06 10:43:58,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:43:58,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:43:58,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:43:58,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:43:58,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:43:58,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:43:58,208 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-06 10:43:58,310 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 20 treesize of output 12 [2025-02-06 10:43:58,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:43:58,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2025-02-06 10:43:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:43:58,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:43:58,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-06 10:43:58,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-06 10:43:58,435 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 20 treesize of output 18 [2025-02-06 10:43:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:43:58,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189106397] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:43:58,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:43:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 25 [2025-02-06 10:43:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141778408] [2025-02-06 10:43:58,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:43:58,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:43:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:43:58,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:43:58,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:43:58,444 INFO L87 Difference]: Start difference. First operand 285 states and 342 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:44:02,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:44:06,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:44:10,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:44:14,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:44:18,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:44:22,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:44:26,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:44:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:26,887 INFO L93 Difference]: Finished difference Result 329 states and 385 transitions. [2025-02-06 10:44:26,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:44:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2025-02-06 10:44:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:26,889 INFO L225 Difference]: With dead ends: 329 [2025-02-06 10:44:26,889 INFO L226 Difference]: Without dead ends: 329 [2025-02-06 10:44:26,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:44:26,890 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 104 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:26,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1575 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 778 Invalid, 7 Unknown, 0 Unchecked, 28.3s Time] [2025-02-06 10:44:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-06 10:44:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 285. [2025-02-06 10:44:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 252 states have (on average 1.246031746031746) internal successors, (314), 267 states have internal predecessors, (314), 9 states have call successors, (9), 6 states have call predecessors, (9), 12 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-06 10:44:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 341 transitions. [2025-02-06 10:44:26,894 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 341 transitions. Word has length 57 [2025-02-06 10:44:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:26,895 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 341 transitions. [2025-02-06 10:44:26,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:44:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 341 transitions. [2025-02-06 10:44:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:44:26,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:26,895 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:26,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-02-06 10:44:27,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-02-06 10:44:27,096 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 22 more)] === [2025-02-06 10:44:27,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1932472457, now seen corresponding path program 2 times [2025-02-06 10:44:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:27,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997524585] [2025-02-06 10:44:27,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:44:27,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:27,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-06 10:44:27,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:44:27,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:44:27,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:44:27,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997524585] [2025-02-06 10:44:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997524585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:44:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995081112] [2025-02-06 10:44:27,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:44:27,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:44:27,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:44:27,488 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:44:27,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-06 10:44:27,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-06 10:44:27,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:44:27,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:44:27,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:27,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 10:44:27,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:44:27,654 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-06 10:44:27,716 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-06 10:44:27,716 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 28 treesize of output 24 [2025-02-06 10:44:27,725 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-06 10:44:28,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2025-02-06 10:44:28,068 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-06 10:44:28,237 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2025-02-06 10:44:28,237 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 44 treesize of output 55 [2025-02-06 10:44:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:44:28,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:44:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995081112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:44:28,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:44:28,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 31 [2025-02-06 10:44:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916286896] [2025-02-06 10:44:28,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:44:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:44:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:28,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:44:28,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1247, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:44:28,758 INFO L87 Difference]: Start difference. First operand 285 states and 341 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)