./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/prefixsum_rec.c -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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:15:08,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:15:08,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:15:08,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:15:08,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:15:08,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:15:08,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:15:08,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:15:08,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:15:08,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:15:08,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:15:08,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:15:08,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:15:08,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:15:08,432 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:15:08,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:15:08,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:15:08,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:15:08,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:15:08,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:15:08,433 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:15:08,433 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:15:08,433 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:15:08,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:15:08,433 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:15:08,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:15:08,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:15:08,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:15:08,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:15:08,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:15:08,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:15:08,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:08,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:08,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:15:08,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:15:08,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:15:08,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:15:08,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:15:08,436 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2025-01-09 22:15:08,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:15:08,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:15:08,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:15:08,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:15:08,701 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:15:08,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-01-09 22:15:09,897 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a68165c34/ea5a22c4c93d4ff9bbf64b0a7c6fa5b1/FLAG6a3669d69 [2025-01-09 22:15:10,115 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:15:10,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-01-09 22:15:10,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a68165c34/ea5a22c4c93d4ff9bbf64b0a7c6fa5b1/FLAG6a3669d69 [2025-01-09 22:15:10,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a68165c34/ea5a22c4c93d4ff9bbf64b0a7c6fa5b1 [2025-01-09 22:15:10,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:15:10,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:15:10,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:15:10,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:15:10,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:15:10,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2823c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10, skipping insertion in model container [2025-01-09 22:15:10,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:15:10,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:15:10,275 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:15:10,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:15:10,302 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:15:10,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10 WrapperNode [2025-01-09 22:15:10,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:15:10,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:15:10,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:15:10,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:15:10,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,324 INFO L138 Inliner]: procedures = 22, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2025-01-09 22:15:10,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:15:10,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:15:10,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:15:10,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:15:10,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,346 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-01-09 22:15:10,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:15:10,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:15:10,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:15:10,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:15:10,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (1/1) ... [2025-01-09 22:15:10,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:10,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:15:10,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:15:10,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:15:10,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 22:15:10,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2025-01-09 22:15:10,403 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2025-01-09 22:15:10,403 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:15:10,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 22:15:10,403 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 22:15:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:15:10,477 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:15:10,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:15:10,777 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-01-09 22:15:10,777 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:15:10,785 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:15:10,785 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:15:10,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:10 BoogieIcfgContainer [2025-01-09 22:15:10,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:15:10,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:15:10,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:15:10,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:15:10,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:15:10" (1/3) ... [2025-01-09 22:15:10,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112a5390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:10, skipping insertion in model container [2025-01-09 22:15:10,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:10" (2/3) ... [2025-01-09 22:15:10,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112a5390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:10, skipping insertion in model container [2025-01-09 22:15:10,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:10" (3/3) ... [2025-01-09 22:15:10,791 INFO L128 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2025-01-09 22:15:10,801 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:15:10,802 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prefixsum_rec.c that has 5 procedures, 105 locations, 1 initial locations, 3 loop locations, and 34 error locations. [2025-01-09 22:15:10,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:15:10,838 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;@2851385b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:15:10,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-01-09 22:15:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 90 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:15:10,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:10,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:10,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2027979009, now seen corresponding path program 1 times [2025-01-09 22:15:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874258810] [2025-01-09 22:15:10,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:10,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:15:10,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:15:10,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:10,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:15:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874258810] [2025-01-09 22:15:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874258810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:10,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855835831] [2025-01-09 22:15:10,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:10,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:10,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:10,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:10,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:15:11,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:15:11,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:15:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:11,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 22:15:11,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:15:11,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:15:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855835831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:15:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 22:15:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218766757] [2025-01-09 22:15:11,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:11,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:15:11,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:11,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:15:11,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:15:11,094 INFO L87 Difference]: Start difference. First operand has 105 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 90 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:11,106 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-01-09 22:15:11,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:15:11,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-01-09 22:15:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:11,111 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:15:11,111 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:15:11,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-01-09 22:15:11,114 INFO L435 NwaCegarLoop]: 114 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, 114 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-01-09 22:15:11,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:15:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 22:15:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 states have internal predecessors, (92), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-01-09 22:15:11,139 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 28 [2025-01-09 22:15:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:11,140 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-01-09 22:15:11,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-01-09 22:15:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:15:11,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:11,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:11,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:15:11,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 22:15:11,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:11,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1111906427, now seen corresponding path program 1 times [2025-01-09 22:15:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167160648] [2025-01-09 22:15:11,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:11,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:15:11,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:15:11,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:11,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:11,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167160648] [2025-01-09 22:15:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167160648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:11,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738344025] [2025-01-09 22:15:11,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:11,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:11,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:11,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:11,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:11,604 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:15:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:11,707 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-01-09 22:15:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:11,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-01-09 22:15:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:11,709 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:15:11,709 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:15:11,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:11,710 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 26 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:11,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 204 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:15:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:15:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 84 states have internal predecessors, (89), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-01-09 22:15:11,716 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 28 [2025-01-09 22:15:11,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:11,717 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-01-09 22:15:11,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:15:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-01-09 22:15:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:15:11,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:11,717 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:11,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:15:11,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:11,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1111906428, now seen corresponding path program 1 times [2025-01-09 22:15:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:11,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076361848] [2025-01-09 22:15:11,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:11,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:15:11,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:15:11,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:11,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:12,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076361848] [2025-01-09 22:15:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076361848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:12,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:12,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:15:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700268087] [2025-01-09 22:15:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:12,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:15:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:12,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:15:12,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:15:12,212 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-01-09 22:15:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:12,511 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2025-01-09 22:15:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:15:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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) Word has length 28 [2025-01-09 22:15:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:12,512 INFO L225 Difference]: With dead ends: 123 [2025-01-09 22:15:12,512 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 22:15:12,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:15:12,513 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 58 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:12,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 543 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:15:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 22:15:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2025-01-09 22:15:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 91 states have internal predecessors, (98), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 22:15:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2025-01-09 22:15:12,519 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 28 [2025-01-09 22:15:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:12,520 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2025-01-09 22:15:12,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-01-09 22:15:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2025-01-09 22:15:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:15:12,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:12,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:12,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:15:12,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:12,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1300421525, now seen corresponding path program 1 times [2025-01-09 22:15:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273668462] [2025-01-09 22:15:12,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:12,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:15:12,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:15:12,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:12,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:12,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273668462] [2025-01-09 22:15:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273668462] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682020847] [2025-01-09 22:15:12,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:12,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:12,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:12,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:12,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:15:13,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:15:13,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:15:13,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:13,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:13,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 22:15:13,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:13,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:15:13,204 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-01-09 22:15:13,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:15:13,331 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-01-09 22:15:13,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:15:13,341 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-01-09 22:15:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:15:13,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:13,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682020847] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:13,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:15:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-01-09 22:15:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753713451] [2025-01-09 22:15:13,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:13,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:15:13,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:13,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:15:13,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:15:13,594 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:15:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:14,208 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2025-01-09 22:15:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:15:14,209 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 29 [2025-01-09 22:15:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:14,210 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:15:14,210 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:15:14,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:15:14,211 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 267 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:14,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 541 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:15:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:15:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2025-01-09 22:15:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 85 states have internal predecessors, (90), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-01-09 22:15:14,216 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2025-01-09 22:15:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:14,218 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-01-09 22:15:14,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:15:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-01-09 22:15:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:15:14,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:14,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:14,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:15:14,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:14,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:14,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 109360922, now seen corresponding path program 1 times [2025-01-09 22:15:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472965487] [2025-01-09 22:15:14,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:14,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:15:14,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:15:14,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:14,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472965487] [2025-01-09 22:15:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472965487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:14,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:14,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992301768] [2025-01-09 22:15:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:14,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:14,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:14,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:14,490 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:14,553 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-01-09 22:15:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:14,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-01-09 22:15:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:14,554 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:15:14,554 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:15:14,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:14,555 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 25 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:14,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 209 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:15:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:15:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 84 states have internal predecessors, (89), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-01-09 22:15:14,565 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 29 [2025-01-09 22:15:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:14,565 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-01-09 22:15:14,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-01-09 22:15:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:15:14,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:14,565 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:14,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:15:14,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:14,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash 109360923, now seen corresponding path program 1 times [2025-01-09 22:15:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089638667] [2025-01-09 22:15:14,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:14,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:15:14,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:15:14,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:14,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089638667] [2025-01-09 22:15:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089638667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:14,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:15:14,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968687687] [2025-01-09 22:15:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:14,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:15:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:14,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:15:14,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:14,800 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:15:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:14,975 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2025-01-09 22:15:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:15:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-01-09 22:15:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:14,976 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:15:14,976 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:15:14,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:15:14,976 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:14,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 394 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:15:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:15:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-01-09 22:15:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 85 states have internal predecessors, (90), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-01-09 22:15:14,980 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2025-01-09 22:15:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:14,981 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-01-09 22:15:14,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:15:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-01-09 22:15:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:15:14,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:14,981 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, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:14,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:15:14,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:14,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1908894976, now seen corresponding path program 1 times [2025-01-09 22:15:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:14,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666264229] [2025-01-09 22:15:14,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:14,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:14,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:15:14,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:15:14,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:14,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:15:15,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666264229] [2025-01-09 22:15:15,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666264229] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360073525] [2025-01-09 22:15:15,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:15,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:15,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:15,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:15,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:15:15,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:15:15,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:15:15,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:15,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:15,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:15:15,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:15:15,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:15:15,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360073525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:15,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:15:15,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 15 [2025-01-09 22:15:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361222364] [2025-01-09 22:15:15,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:15,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:15:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:15,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:15:15,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:15:15,245 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:15:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:15,297 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-01-09 22:15:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:15:15,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2025-01-09 22:15:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:15,298 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:15:15,298 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:15:15,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:15:15,299 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 15 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:15,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 372 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:15:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 22:15:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 86 states have internal predecessors, (91), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-01-09 22:15:15,307 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2025-01-09 22:15:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:15,307 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-01-09 22:15:15,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:15:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-01-09 22:15:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:15:15,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:15,308 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:15,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:15:15,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:15,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:15,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash 758763375, now seen corresponding path program 1 times [2025-01-09 22:15:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574711598] [2025-01-09 22:15:15,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:15,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:15:15,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:15:15,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:15,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:15,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:15,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574711598] [2025-01-09 22:15:15,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574711598] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:15,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815376459] [2025-01-09 22:15:15,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:15,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:15,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:15,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:15,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:15:15,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:15:15,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:15:15,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:15,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:15,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:15:15,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:15,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:15:15,935 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 10 treesize of output 9 [2025-01-09 22:15:16,053 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:15:16,053 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 16 treesize of output 15 [2025-01-09 22:15:16,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:15:16,063 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-01-09 22:15:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:15:16,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:16,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815376459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:16,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:15:16,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2025-01-09 22:15:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022717667] [2025-01-09 22:15:16,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:16,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:15:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:16,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:15:16,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:15:16,594 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:17,154 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2025-01-09 22:15:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:15:17,154 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 33 [2025-01-09 22:15:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:17,155 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:15:17,155 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:15:17,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 22:15:17,156 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 220 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:17,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 328 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:15:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:15:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2025-01-09 22:15:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 88 states have internal predecessors, (93), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2025-01-09 22:15:17,161 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 33 [2025-01-09 22:15:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:17,161 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2025-01-09 22:15:17,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2025-01-09 22:15:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:15:17,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:17,162 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, 1, 1, 1] [2025-01-09 22:15:17,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:15:17,363 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,SelfDestructingSolverStorable7 [2025-01-09 22:15:17,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:17,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2046828168, now seen corresponding path program 1 times [2025-01-09 22:15:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351538648] [2025-01-09 22:15:17,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:17,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:15:17,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:15:17,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:17,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351538648] [2025-01-09 22:15:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351538648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558336097] [2025-01-09 22:15:17,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:17,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:17,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:17,528 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-01-09 22:15:17,530 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-01-09 22:15:17,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:15:17,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:15:17,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:17,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:17,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:15:17,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:17,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 10 treesize of output 9 [2025-01-09 22:15:17,682 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:15:17,683 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 16 treesize of output 18 [2025-01-09 22:15:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:17,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558336097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:18,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:15:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2025-01-09 22:15:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353894224] [2025-01-09 22:15:18,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:18,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:15:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:18,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:15:18,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:15:18,190 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:15:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:18,705 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2025-01-09 22:15:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:15:18,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2025-01-09 22:15:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:18,706 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:15:18,706 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:15:18,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:15:18,706 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 98 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:18,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 517 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:15:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:15:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 22:15:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 87 states have internal predecessors, (92), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-01-09 22:15:18,709 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 34 [2025-01-09 22:15:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:18,710 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-01-09 22:15:18,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:15:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-01-09 22:15:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:15:18,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:18,710 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-01-09 22:15:18,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:15:18,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:18,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:18,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1407277171, now seen corresponding path program 2 times [2025-01-09 22:15:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685321040] [2025-01-09 22:15:18,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:15:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:18,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 22:15:18,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:15:18,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:15:18,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:15:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:19,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685321040] [2025-01-09 22:15:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685321040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:19,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773728152] [2025-01-09 22:15:19,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:15:19,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:19,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:19,350 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-01-09 22:15:19,352 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-01-09 22:15:19,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 22:15:19,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:15:19,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:15:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:19,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:15:19,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:19,463 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 10 treesize of output 9 [2025-01-09 22:15:19,586 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:15:19,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-01-09 22:15:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:15:19,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:20,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773728152] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:20,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:15:20,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2025-01-09 22:15:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795129405] [2025-01-09 22:15:20,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:20,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:15:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:20,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:15:20,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:15:20,175 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:21,009 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2025-01-09 22:15:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:15:21,010 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2025-01-09 22:15:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:21,010 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:15:21,010 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:15:21,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 22:15:21,011 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 157 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:21,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 630 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:15:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:15:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2025-01-09 22:15:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 91 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2025-01-09 22:15:21,014 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 37 [2025-01-09 22:15:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:21,014 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2025-01-09 22:15:21,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2025-01-09 22:15:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:15:21,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:21,015 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:15:21,023 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-01-09 22:15:21,219 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,SelfDestructingSolverStorable9 [2025-01-09 22:15:21,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:21,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1028977236, now seen corresponding path program 1 times [2025-01-09 22:15:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:21,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192045682] [2025-01-09 22:15:21,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:21,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:21,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:15:21,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:15:21,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:21,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192045682] [2025-01-09 22:15:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192045682] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871656892] [2025-01-09 22:15:21,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:21,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:21,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:21,439 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-01-09 22:15:21,441 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-01-09 22:15:21,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:15:21,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:15:21,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:21,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:21,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 22:15:21,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:21,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:22,009 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 71 treesize of output 65 [2025-01-09 22:15:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871656892] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:22,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:22,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-01-09 22:15:22,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869359216] [2025-01-09 22:15:22,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:22,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:15:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:22,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:15:22,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:15:22,267 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:22,801 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2025-01-09 22:15:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:15:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 40 [2025-01-09 22:15:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:22,802 INFO L225 Difference]: With dead ends: 149 [2025-01-09 22:15:22,802 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 22:15:22,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=2001, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 22:15:22,803 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 155 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:22,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 759 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:15:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 22:15:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 118. [2025-01-09 22:15:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 100 states have internal predecessors, (114), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 22:15:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2025-01-09 22:15:22,807 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 40 [2025-01-09 22:15:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:22,807 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2025-01-09 22:15:22,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2025-01-09 22:15:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:15:22,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:22,808 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:15:22,815 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-01-09 22:15:23,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:23,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting upsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:23,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1028977235, now seen corresponding path program 1 times [2025-01-09 22:15:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:23,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143950037] [2025-01-09 22:15:23,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:23,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:23,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:15:23,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:15:23,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:23,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:15:23,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143950037] [2025-01-09 22:15:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143950037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:23,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:15:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252216258] [2025-01-09 22:15:23,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:23,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:15:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:23,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:15:23,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:23,059 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:23,135 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2025-01-09 22:15:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:15:23,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-01-09 22:15:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:23,136 INFO L225 Difference]: With dead ends: 115 [2025-01-09 22:15:23,136 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 22:15:23,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:23,136 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:23,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 236 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 22:15:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-01-09 22:15:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.445945945945946) internal successors, (107), 97 states have internal predecessors, (107), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 22:15:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2025-01-09 22:15:23,142 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 40 [2025-01-09 22:15:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:23,143 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2025-01-09 22:15:23,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2025-01-09 22:15:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:15:23,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:23,143 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:15:23,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:15:23,144 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting upsweepErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:23,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1833523233, now seen corresponding path program 1 times [2025-01-09 22:15:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147128387] [2025-01-09 22:15:23,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:23,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:23,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:15:23,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:15:23,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:23,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:23,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147128387] [2025-01-09 22:15:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147128387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622146300] [2025-01-09 22:15:23,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:23,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:23,308 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-01-09 22:15:23,309 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-01-09 22:15:23,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:15:23,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:15:23,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:23,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:23,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:15:23,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:23,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:23,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-01-09 22:15:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622146300] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:23,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-01-09 22:15:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513048400] [2025-01-09 22:15:23,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:23,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:15:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:23,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:15:23,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:15:23,737 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:24,181 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2025-01-09 22:15:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:15:24,184 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 41 [2025-01-09 22:15:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:24,185 INFO L225 Difference]: With dead ends: 126 [2025-01-09 22:15:24,185 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 22:15:24,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 22:15:24,185 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 51 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:24,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1338 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:15:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 22:15:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-01-09 22:15:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 104 states have internal predecessors, (114), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 22:15:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2025-01-09 22:15:24,191 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 41 [2025-01-09 22:15:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:24,191 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2025-01-09 22:15:24,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2025-01-09 22:15:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:15:24,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:24,192 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:15:24,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:15:24,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:24,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:24,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1077524463, now seen corresponding path program 1 times [2025-01-09 22:15:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171546118] [2025-01-09 22:15:24,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:24,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:15:24,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:15:24,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:24,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171546118] [2025-01-09 22:15:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171546118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55859998] [2025-01-09 22:15:24,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:24,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:24,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:24,477 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-01-09 22:15:24,479 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-01-09 22:15:24,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:15:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:15:24,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:24,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:24,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:15:24,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:24,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55859998] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:24,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:24,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2025-01-09 22:15:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691099199] [2025-01-09 22:15:24,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:24,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:15:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:24,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:15:24,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:15:24,677 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:24,773 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2025-01-09 22:15:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:15:24,773 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-01-09 22:15:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:24,774 INFO L225 Difference]: With dead ends: 141 [2025-01-09 22:15:24,775 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 22:15:24,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:15:24,775 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 19 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:24,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 855 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 22:15:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2025-01-09 22:15:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 112 states have internal predecessors, (121), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 22:15:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2025-01-09 22:15:24,779 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 43 [2025-01-09 22:15:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:24,780 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2025-01-09 22:15:24,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2025-01-09 22:15:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:15:24,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:24,780 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-01-09 22:15:24,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:15:24,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:24,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:24,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1507114871, now seen corresponding path program 3 times [2025-01-09 22:15:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041867425] [2025-01-09 22:15:24,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:15:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:24,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-01-09 22:15:25,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 41 statements. [2025-01-09 22:15:25,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:15:25,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 22:15:25,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:25,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041867425] [2025-01-09 22:15:25,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041867425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:25,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663505950] [2025-01-09 22:15:25,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:15:25,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:25,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:25,148 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-01-09 22:15:25,150 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-01-09 22:15:25,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-01-09 22:15:25,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 41 statements. [2025-01-09 22:15:25,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:15:25,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:25,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:15:25,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:25,237 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-01-09 22:15:25,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:15:25,313 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:15:25,314 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-01-09 22:15:25,332 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 16 treesize of output 11 [2025-01-09 22:15:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:15:25,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:25,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663505950] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:25,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:15:25,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2025-01-09 22:15:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360825859] [2025-01-09 22:15:25,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:25,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 22:15:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:25,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 22:15:25,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:15:25,683 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:26,084 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2025-01-09 22:15:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:15:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 41 [2025-01-09 22:15:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:26,086 INFO L225 Difference]: With dead ends: 133 [2025-01-09 22:15:26,086 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 22:15:26,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:15:26,086 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 163 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:26,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 432 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:15:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 22:15:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-01-09 22:15:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 110 states have internal predecessors, (119), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 22:15:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2025-01-09 22:15:26,092 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 41 [2025-01-09 22:15:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:26,092 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2025-01-09 22:15:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:15:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2025-01-09 22:15:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:15:26,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:26,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:26,100 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-01-09 22:15:26,294 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,SelfDestructingSolverStorable14 [2025-01-09 22:15:26,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 962382835, now seen corresponding path program 2 times [2025-01-09 22:15:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028875692] [2025-01-09 22:15:26,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:15:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:26,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-09 22:15:26,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:15:26,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:15:26,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:15:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028875692] [2025-01-09 22:15:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028875692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365173875] [2025-01-09 22:15:26,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:15:26,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:26,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:26,398 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-01-09 22:15:26,400 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-01-09 22:15:26,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-09 22:15:26,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:15:26,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:15:26,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:26,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:15:26,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:15:26,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:26,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365173875] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:26,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:26,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 24 [2025-01-09 22:15:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163785929] [2025-01-09 22:15:26,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:26,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:15:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:26,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:15:26,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:15:26,755 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 22:15:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:27,018 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2025-01-09 22:15:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:15:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2025-01-09 22:15:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:27,021 INFO L225 Difference]: With dead ends: 149 [2025-01-09 22:15:27,021 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 22:15:27,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:15:27,023 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 71 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:27,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 883 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:15:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 22:15:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2025-01-09 22:15:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.32) internal successors, (132), 122 states have internal predecessors, (132), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 22:15:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2025-01-09 22:15:27,028 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 47 [2025-01-09 22:15:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:27,028 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2025-01-09 22:15:27,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 22:15:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2025-01-09 22:15:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:15:27,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:27,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:27,036 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-01-09 22:15:27,229 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,SelfDestructingSolverStorable15 [2025-01-09 22:15:27,229 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:27,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1850583501, now seen corresponding path program 1 times [2025-01-09 22:15:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:27,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810690010] [2025-01-09 22:15:27,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:27,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:15:27,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:15:27,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:27,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:15:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810690010] [2025-01-09 22:15:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810690010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:27,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:27,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:15:27,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535635713] [2025-01-09 22:15:27,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:27,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:15:27,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:27,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:15:27,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:27,279 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:15:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:27,353 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2025-01-09 22:15:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:15:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-01-09 22:15:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:27,354 INFO L225 Difference]: With dead ends: 139 [2025-01-09 22:15:27,354 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 22:15:27,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:27,355 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 46 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:27,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 213 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 22:15:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-01-09 22:15:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.27) internal successors, (127), 117 states have internal predecessors, (127), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 22:15:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2025-01-09 22:15:27,362 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 49 [2025-01-09 22:15:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:27,362 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2025-01-09 22:15:27,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:15:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2025-01-09 22:15:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:15:27,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:27,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:27,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:15:27,362 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1850583502, now seen corresponding path program 1 times [2025-01-09 22:15:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:27,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047722380] [2025-01-09 22:15:27,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:27,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:15:27,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:15:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047722380] [2025-01-09 22:15:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047722380] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925054540] [2025-01-09 22:15:27,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:27,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:27,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:27,582 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-01-09 22:15:27,584 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-01-09 22:15:27,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:15:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:15:27,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:27,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:27,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:15:27,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:27,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:27,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-09 22:15:27,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:15:27,929 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 21 treesize of output 25 [2025-01-09 22:15:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925054540] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:28,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-01-09 22:15:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709588420] [2025-01-09 22:15:28,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:28,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:15:28,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:28,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:15:28,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:15:28,041 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 33 states, 32 states have (on average 2.40625) internal successors, (77), 30 states have internal predecessors, (77), 13 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 22:15:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:28,621 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2025-01-09 22:15:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:15:28,622 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 30 states have internal predecessors, (77), 13 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 49 [2025-01-09 22:15:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:28,623 INFO L225 Difference]: With dead ends: 182 [2025-01-09 22:15:28,623 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 22:15:28,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 22:15:28,624 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 99 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:28,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1124 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:15:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 22:15:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2025-01-09 22:15:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 137 states have internal predecessors, (153), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 22:15:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2025-01-09 22:15:28,635 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 49 [2025-01-09 22:15:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:28,635 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2025-01-09 22:15:28,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 30 states have internal predecessors, (77), 13 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 22:15:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2025-01-09 22:15:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:15:28,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:28,636 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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-01-09 22:15:28,644 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-01-09 22:15:28,842 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-01-09 22:15:28,842 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:28,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash 51265015, now seen corresponding path program 3 times [2025-01-09 22:15:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647554741] [2025-01-09 22:15:28,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:15:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:28,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 5 equivalence classes. [2025-01-09 22:15:28,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 51 statements. [2025-01-09 22:15:28,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:15:28,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 22:15:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647554741] [2025-01-09 22:15:29,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647554741] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573002213] [2025-01-09 22:15:29,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:15:29,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:29,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:29,145 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-01-09 22:15:29,145 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-01-09 22:15:29,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 5 equivalence classes. [2025-01-09 22:15:29,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 51 statements. [2025-01-09 22:15:29,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:15:29,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:29,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 22:15:29,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:15:29,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:30,033 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 50 treesize of output 46 [2025-01-09 22:15:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:15:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573002213] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:30,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2025-01-09 22:15:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964571667] [2025-01-09 22:15:30,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:30,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 22:15:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:30,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 22:15:30,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 22:15:30,228 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand has 42 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:30,931 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2025-01-09 22:15:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:15:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 51 [2025-01-09 22:15:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:30,933 INFO L225 Difference]: With dead ends: 181 [2025-01-09 22:15:30,933 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 22:15:30,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=359, Invalid=2397, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 22:15:30,934 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 88 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:30,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1286 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:15:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 22:15:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2025-01-09 22:15:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 145 states have internal predecessors, (163), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 22:15:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2025-01-09 22:15:30,941 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 51 [2025-01-09 22:15:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:30,941 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2025-01-09 22:15:30,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2025-01-09 22:15:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:15:30,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:30,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:30,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:15:31,141 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-01-09 22:15:31,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting downsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:31,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash 532848997, now seen corresponding path program 1 times [2025-01-09 22:15:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642806540] [2025-01-09 22:15:31,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:31,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:15:31,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:15:31,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:31,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642806540] [2025-01-09 22:15:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642806540] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351817974] [2025-01-09 22:15:31,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:31,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:31,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:31,425 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-01-09 22:15:31,426 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-01-09 22:15:31,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:15:31,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:15:31,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:31,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:31,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:15:31,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:31,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:31,697 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 29 treesize of output 25 [2025-01-09 22:15:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:32,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351817974] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:32,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:32,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2025-01-09 22:15:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295733922] [2025-01-09 22:15:32,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:32,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:15:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:32,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:15:32,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:15:32,068 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 31 states have internal predecessors, (84), 11 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-09 22:15:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:32,655 INFO L93 Difference]: Finished difference Result 241 states and 287 transitions. [2025-01-09 22:15:32,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:15:32,655 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 31 states have internal predecessors, (84), 11 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 52 [2025-01-09 22:15:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:32,657 INFO L225 Difference]: With dead ends: 241 [2025-01-09 22:15:32,657 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 22:15:32,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1856, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 22:15:32,657 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 144 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:32,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1272 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:15:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 22:15:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 189. [2025-01-09 22:15:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 155 states have internal predecessors, (172), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 22:15:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2025-01-09 22:15:32,664 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 52 [2025-01-09 22:15:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:32,664 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2025-01-09 22:15:32,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 31 states have internal predecessors, (84), 11 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-09 22:15:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2025-01-09 22:15:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:15:32,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:32,665 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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-01-09 22:15:32,674 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-01-09 22:15:32,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:32,866 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting upsweepErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:32,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1589215454, now seen corresponding path program 1 times [2025-01-09 22:15:32,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:32,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922306321] [2025-01-09 22:15:32,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:32,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:15:32,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:15:32,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 22:15:33,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:33,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922306321] [2025-01-09 22:15:33,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922306321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:33,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:33,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:15:33,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776999480] [2025-01-09 22:15:33,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:33,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:15:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:33,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:15:33,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:15:33,078 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand has 13 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:15:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:33,257 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2025-01-09 22:15:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:15:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2025-01-09 22:15:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:33,258 INFO L225 Difference]: With dead ends: 189 [2025-01-09 22:15:33,258 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 22:15:33,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:15:33,259 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 47 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:33,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 515 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 22:15:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2025-01-09 22:15:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 141 states have (on average 1.2056737588652482) internal successors, (170), 154 states have internal predecessors, (170), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 22:15:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2025-01-09 22:15:33,264 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 52 [2025-01-09 22:15:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:33,265 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2025-01-09 22:15:33,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:15:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2025-01-09 22:15:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:15:33,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:33,266 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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-01-09 22:15:33,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:15:33,266 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:33,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1774017172, now seen corresponding path program 4 times [2025-01-09 22:15:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038384073] [2025-01-09 22:15:33,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:15:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:33,280 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-01-09 22:15:33,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 54 statements. [2025-01-09 22:15:33,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:15:33,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:33,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038384073] [2025-01-09 22:15:33,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038384073] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:33,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975000211] [2025-01-09 22:15:33,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:15:33,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:33,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:33,389 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-01-09 22:15:33,390 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-01-09 22:15:33,442 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-01-09 22:15:33,457 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 54 statements. [2025-01-09 22:15:33,457 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:15:33,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:15:33,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:33,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975000211] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:33,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 31 [2025-01-09 22:15:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798636400] [2025-01-09 22:15:33,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:33,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 22:15:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:33,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 22:15:33,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:15:33,778 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand has 31 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 8 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:34,052 INFO L93 Difference]: Finished difference Result 255 states and 292 transitions. [2025-01-09 22:15:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:15:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 8 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2025-01-09 22:15:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:34,054 INFO L225 Difference]: With dead ends: 255 [2025-01-09 22:15:34,054 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 22:15:34,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 22:15:34,056 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 82 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:34,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 940 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:15:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 22:15:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 220. [2025-01-09 22:15:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 167 states have (on average 1.1916167664670658) internal successors, (199), 181 states have internal predecessors, (199), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 22:15:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2025-01-09 22:15:34,062 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 54 [2025-01-09 22:15:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:34,063 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2025-01-09 22:15:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 8 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2025-01-09 22:15:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:15:34,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:34,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:34,072 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-01-09 22:15:34,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:34,269 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:34,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash -549551548, now seen corresponding path program 1 times [2025-01-09 22:15:34,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793569525] [2025-01-09 22:15:34,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:34,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:15:34,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:15:34,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:34,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:34,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793569525] [2025-01-09 22:15:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793569525] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:34,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355640330] [2025-01-09 22:15:34,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:34,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:34,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:34,393 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-01-09 22:15:34,394 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-01-09 22:15:34,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:15:34,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:15:34,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:34,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:34,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:15:34,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:34,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355640330] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:34,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:34,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-01-09 22:15:34,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336001454] [2025-01-09 22:15:34,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:34,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 22:15:34,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:34,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 22:15:34,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2025-01-09 22:15:34,675 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand has 29 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 26 states have internal predecessors, (86), 11 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 22:15:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:34,790 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2025-01-09 22:15:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:15:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 26 states have internal predecessors, (86), 11 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 59 [2025-01-09 22:15:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:34,792 INFO L225 Difference]: With dead ends: 234 [2025-01-09 22:15:34,792 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 22:15:34,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:15:34,792 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 71 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:34,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1036 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 22:15:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2025-01-09 22:15:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 192 states have internal predecessors, (210), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 22:15:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 264 transitions. [2025-01-09 22:15:34,799 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 264 transitions. Word has length 59 [2025-01-09 22:15:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:34,800 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 264 transitions. [2025-01-09 22:15:34,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 26 states have internal predecessors, (86), 11 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 22:15:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 264 transitions. [2025-01-09 22:15:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 22:15:34,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:34,801 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:34,809 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-01-09 22:15:35,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:35,003 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:35,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash 386554574, now seen corresponding path program 1 times [2025-01-09 22:15:35,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:35,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459356436] [2025-01-09 22:15:35,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:35,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:35,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 22:15:35,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:15:35,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:35,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459356436] [2025-01-09 22:15:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459356436] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473763989] [2025-01-09 22:15:35,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:35,459 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-01-09 22:15:35,460 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-01-09 22:15:35,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 22:15:35,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:15:35,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:35,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:35,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 22:15:35,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:36,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:36,906 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 256 treesize of output 246 [2025-01-09 22:15:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473763989] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:37,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 53 [2025-01-09 22:15:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311171432] [2025-01-09 22:15:37,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:37,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 22:15:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:37,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 22:15:37,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2589, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 22:15:37,858 INFO L87 Difference]: Start difference. First operand 233 states and 264 transitions. Second operand has 54 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 15 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-09 22:15:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:41,402 INFO L93 Difference]: Finished difference Result 338 states and 376 transitions. [2025-01-09 22:15:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-09 22:15:41,403 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 15 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 60 [2025-01-09 22:15:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:41,404 INFO L225 Difference]: With dead ends: 338 [2025-01-09 22:15:41,404 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 22:15:41,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=975, Invalid=9531, Unknown=0, NotChecked=0, Total=10506 [2025-01-09 22:15:41,406 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 2650 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:41,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2757 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 22:15:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 22:15:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 244. [2025-01-09 22:15:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 186 states have (on average 1.1612903225806452) internal successors, (216), 200 states have internal predecessors, (216), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:15:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 274 transitions. [2025-01-09 22:15:41,411 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 274 transitions. Word has length 60 [2025-01-09 22:15:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:41,411 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 274 transitions. [2025-01-09 22:15:41,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 15 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-09 22:15:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 274 transitions. [2025-01-09 22:15:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 22:15:41,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:41,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:41,418 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-01-09 22:15:41,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:41,613 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 212697172, now seen corresponding path program 1 times [2025-01-09 22:15:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174725733] [2025-01-09 22:15:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:41,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:15:41,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:15:41,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:41,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:15:41,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:41,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174725733] [2025-01-09 22:15:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174725733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:41,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591431512] [2025-01-09 22:15:41,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:41,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:41,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:41,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:41,657 INFO L87 Difference]: Start difference. First operand 244 states and 274 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:15:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:41,698 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2025-01-09 22:15:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:41,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-01-09 22:15:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:41,699 INFO L225 Difference]: With dead ends: 243 [2025-01-09 22:15:41,700 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 22:15:41,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:41,700 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 28 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:41,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 22:15:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-01-09 22:15:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 186 states have (on average 1.1559139784946237) internal successors, (215), 199 states have internal predecessors, (215), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:15:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 273 transitions. [2025-01-09 22:15:41,705 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 273 transitions. Word has length 61 [2025-01-09 22:15:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:41,705 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 273 transitions. [2025-01-09 22:15:41,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:15:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 273 transitions. [2025-01-09 22:15:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 22:15:41,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:41,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:41,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:15:41,706 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:41,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash 212697173, now seen corresponding path program 1 times [2025-01-09 22:15:41,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:41,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849004017] [2025-01-09 22:15:41,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:41,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:41,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:15:41,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:15:41,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:41,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:41,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:41,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849004017] [2025-01-09 22:15:41,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849004017] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:41,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062028671] [2025-01-09 22:15:41,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:41,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:41,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:41,896 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-01-09 22:15:41,897 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-01-09 22:15:41,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:15:41,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:15:41,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:41,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:41,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:15:41,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:15:42,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:42,176 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 21 treesize of output 17 [2025-01-09 22:15:42,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:15:42,239 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 18 treesize of output 22 [2025-01-09 22:15:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:15:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062028671] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:42,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2025-01-09 22:15:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465058032] [2025-01-09 22:15:42,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:15:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:42,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:15:42,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:15:42,325 INFO L87 Difference]: Start difference. First operand 243 states and 273 transitions. Second operand has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-01-09 22:15:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:42,755 INFO L93 Difference]: Finished difference Result 271 states and 310 transitions. [2025-01-09 22:15:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:15:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 61 [2025-01-09 22:15:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:42,756 INFO L225 Difference]: With dead ends: 271 [2025-01-09 22:15:42,756 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 22:15:42,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:15:42,757 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 152 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:42,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 551 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:15:42,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 22:15:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 252. [2025-01-09 22:15:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 195 states have (on average 1.1743589743589744) internal successors, (229), 208 states have internal predecessors, (229), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:15:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 287 transitions. [2025-01-09 22:15:42,763 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 287 transitions. Word has length 61 [2025-01-09 22:15:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:42,764 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 287 transitions. [2025-01-09 22:15:42,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-01-09 22:15:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 287 transitions. [2025-01-09 22:15:42,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 22:15:42,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:42,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:42,775 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-01-09 22:15:42,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:15:42,971 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:42,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1755798187, now seen corresponding path program 1 times [2025-01-09 22:15:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:42,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711819205] [2025-01-09 22:15:42,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:42,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:15:42,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:15:42,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:42,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:43,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711819205] [2025-01-09 22:15:43,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711819205] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:43,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625021286] [2025-01-09 22:15:43,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:43,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:43,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:43,071 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-01-09 22:15:43,072 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-01-09 22:15:43,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:15:43,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:15:43,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:43,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:43,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:15:43,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:43,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625021286] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:43,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-01-09 22:15:43,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495543380] [2025-01-09 22:15:43,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:43,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:15:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:43,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:15:43,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:15:43,249 INFO L87 Difference]: Start difference. First operand 252 states and 287 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 22:15:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:43,327 INFO L93 Difference]: Finished difference Result 255 states and 286 transitions. [2025-01-09 22:15:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:15:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2025-01-09 22:15:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:43,328 INFO L225 Difference]: With dead ends: 255 [2025-01-09 22:15:43,328 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 22:15:43,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:15:43,329 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 39 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:43,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 516 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 22:15:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2025-01-09 22:15:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 195 states have (on average 1.1641025641025642) internal successors, (227), 208 states have internal predecessors, (227), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:15:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 285 transitions. [2025-01-09 22:15:43,335 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 285 transitions. Word has length 63 [2025-01-09 22:15:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:43,336 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 285 transitions. [2025-01-09 22:15:43,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 22:15:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 285 transitions. [2025-01-09 22:15:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 22:15:43,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:43,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:43,345 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-01-09 22:15:43,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:43,539 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:43,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:43,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1384761044, now seen corresponding path program 1 times [2025-01-09 22:15:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:43,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676415815] [2025-01-09 22:15:43,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:43,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 22:15:43,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 22:15:43,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:43,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:15:44,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676415815] [2025-01-09 22:15:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676415815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18445479] [2025-01-09 22:15:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:44,604 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-01-09 22:15:44,606 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-01-09 22:15:44,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 22:15:44,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 22:15:44,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:44,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:44,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-09 22:15:44,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:44,903 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 13 treesize of output 9 [2025-01-09 22:15:45,049 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 23 treesize of output 19 [2025-01-09 22:15:45,082 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 9 treesize of output 3 [2025-01-09 22:15:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:45,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:45,305 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 23 treesize of output 21 [2025-01-09 22:15:45,309 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 27 treesize of output 25 [2025-01-09 22:15:45,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-01-09 22:15:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18445479] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:45,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:45,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 17] total 50 [2025-01-09 22:15:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080229958] [2025-01-09 22:15:45,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:45,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 22:15:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:45,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 22:15:45,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2270, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 22:15:45,769 INFO L87 Difference]: Start difference. First operand 252 states and 285 transitions. Second operand has 50 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 44 states have internal predecessors, (115), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2025-01-09 22:15:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:47,287 INFO L93 Difference]: Finished difference Result 309 states and 356 transitions. [2025-01-09 22:15:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 22:15:47,288 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 44 states have internal predecessors, (115), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 64 [2025-01-09 22:15:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:47,289 INFO L225 Difference]: With dead ends: 309 [2025-01-09 22:15:47,289 INFO L226 Difference]: Without dead ends: 309 [2025-01-09 22:15:47,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=449, Invalid=5251, Unknown=0, NotChecked=0, Total=5700 [2025-01-09 22:15:47,290 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 161 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:47,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1057 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:15:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-09 22:15:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 257. [2025-01-09 22:15:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 200 states have (on average 1.16) internal successors, (232), 212 states have internal predecessors, (232), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:15:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 290 transitions. [2025-01-09 22:15:47,302 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 290 transitions. Word has length 64 [2025-01-09 22:15:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:47,303 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 290 transitions. [2025-01-09 22:15:47,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 44 states have internal predecessors, (115), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2025-01-09 22:15:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 290 transitions. [2025-01-09 22:15:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 22:15:47,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:47,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:47,310 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-01-09 22:15:47,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:15:47,504 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:47,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash -22074498, now seen corresponding path program 1 times [2025-01-09 22:15:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126937054] [2025-01-09 22:15:47,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:47,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 22:15:47,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:15:47,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:47,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:15:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:47,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126937054] [2025-01-09 22:15:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126937054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:47,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:15:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126190994] [2025-01-09 22:15:47,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:47,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:15:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:47,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:15:47,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:47,565 INFO L87 Difference]: Start difference. First operand 257 states and 290 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:15:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:47,621 INFO L93 Difference]: Finished difference Result 256 states and 288 transitions. [2025-01-09 22:15:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:15:47,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2025-01-09 22:15:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:47,622 INFO L225 Difference]: With dead ends: 256 [2025-01-09 22:15:47,622 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 22:15:47,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:47,623 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 23 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:47,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 229 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 22:15:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-01-09 22:15:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 200 states have (on average 1.15) internal successors, (230), 211 states have internal predecessors, (230), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:15:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 288 transitions. [2025-01-09 22:15:47,632 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 288 transitions. Word has length 65 [2025-01-09 22:15:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:47,633 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 288 transitions. [2025-01-09 22:15:47,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:15:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 288 transitions. [2025-01-09 22:15:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 22:15:47,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:47,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:47,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:15:47,635 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:47,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash -22074497, now seen corresponding path program 1 times [2025-01-09 22:15:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273582090] [2025-01-09 22:15:47,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:47,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:47,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 22:15:47,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:15:47,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:47,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:47,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:47,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273582090] [2025-01-09 22:15:47,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273582090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:47,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007160301] [2025-01-09 22:15:47,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:47,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:47,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:47,791 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-01-09 22:15:47,792 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-01-09 22:15:47,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 22:15:47,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:15:47,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:47,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:47,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:15:47,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:48,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:48,097 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 22 treesize of output 18 [2025-01-09 22:15:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:15:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007160301] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:48,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2025-01-09 22:15:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123616567] [2025-01-09 22:15:48,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:48,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:15:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:48,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:15:48,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:15:48,140 INFO L87 Difference]: Start difference. First operand 256 states and 288 transitions. Second operand has 16 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-09 22:15:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:48,360 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2025-01-09 22:15:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:15:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 65 [2025-01-09 22:15:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:48,361 INFO L225 Difference]: With dead ends: 263 [2025-01-09 22:15:48,361 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 22:15:48,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:15:48,361 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 142 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:48,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 372 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:15:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 22:15:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2025-01-09 22:15:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 204 states have (on average 1.142156862745098) internal successors, (233), 214 states have internal predecessors, (233), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:15:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 291 transitions. [2025-01-09 22:15:48,366 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 291 transitions. Word has length 65 [2025-01-09 22:15:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:48,367 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 291 transitions. [2025-01-09 22:15:48,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-09 22:15:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 291 transitions. [2025-01-09 22:15:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:15:48,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:48,367 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 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-01-09 22:15:48,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-01-09 22:15:48,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:48,568 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:48,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1169207328, now seen corresponding path program 5 times [2025-01-09 22:15:48,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:48,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091209221] [2025-01-09 22:15:48,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:15:48,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:48,576 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 8 equivalence classes. [2025-01-09 22:15:48,597 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:15:48,598 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-09 22:15:48,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:15:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091209221] [2025-01-09 22:15:48,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091209221] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397798360] [2025-01-09 22:15:48,747 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:15:48,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:48,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:48,753 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-01-09 22:15:48,754 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-01-09 22:15:48,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 8 equivalence classes. [2025-01-09 22:15:49,000 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:15:49,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-09 22:15:49,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:49,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 22:15:49,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:15:49,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 91 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:15:49,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397798360] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:49,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:49,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 40 [2025-01-09 22:15:49,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558758577] [2025-01-09 22:15:49,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:49,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 22:15:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:49,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 22:15:49,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 22:15:49,639 INFO L87 Difference]: Start difference. First operand 259 states and 291 transitions. Second operand has 40 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 38 states have internal predecessors, (119), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 22:15:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:50,305 INFO L93 Difference]: Finished difference Result 293 states and 331 transitions. [2025-01-09 22:15:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 22:15:50,306 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 38 states have internal predecessors, (119), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-01-09 22:15:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:50,307 INFO L225 Difference]: With dead ends: 293 [2025-01-09 22:15:50,307 INFO L226 Difference]: Without dead ends: 293 [2025-01-09 22:15:50,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=558, Invalid=3102, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 22:15:50,308 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 97 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:50,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1347 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:15:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-09 22:15:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2025-01-09 22:15:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 232 states have (on average 1.1379310344827587) internal successors, (264), 242 states have internal predecessors, (264), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:15:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 322 transitions. [2025-01-09 22:15:50,314 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 322 transitions. Word has length 66 [2025-01-09 22:15:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:50,314 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 322 transitions. [2025-01-09 22:15:50,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 38 states have internal predecessors, (119), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 22:15:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 322 transitions. [2025-01-09 22:15:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 22:15:50,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:50,315 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 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-01-09 22:15:50,323 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-01-09 22:15:50,515 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,SelfDestructingSolverStorable30 [2025-01-09 22:15:50,516 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:15:50,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash 956036956, now seen corresponding path program 6 times [2025-01-09 22:15:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457345444] [2025-01-09 22:15:50,516 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:15:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:50,524 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 9 equivalence classes. [2025-01-09 22:15:50,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 54 of 70 statements. [2025-01-09 22:15:50,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-01-09 22:15:50,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 50 proven. 54 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 22:15:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457345444] [2025-01-09 22:15:51,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457345444] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641725791] [2025-01-09 22:15:51,295 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:15:51,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:51,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:51,297 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-01-09 22:15:51,298 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-01-09 22:15:51,366 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 9 equivalence classes. [2025-01-09 22:15:51,445 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 54 of 70 statements. [2025-01-09 22:15:51,445 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-01-09 22:15:51,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:51,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 22:15:51,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 21 proven. 68 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 22:15:52,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:54,362 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 233 treesize of output 227 [2025-01-09 22:15:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 22:15:55,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641725791] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:55,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:55,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 22] total 69 [2025-01-09 22:15:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68008922] [2025-01-09 22:15:55,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:55,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-01-09 22:15:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:55,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-01-09 22:15:55,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=4308, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 22:15:55,813 INFO L87 Difference]: Start difference. First operand 287 states and 322 transitions. Second operand has 70 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 60 states have internal predecessors, (106), 19 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 22:15:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:59,916 INFO L93 Difference]: Finished difference Result 340 states and 384 transitions. [2025-01-09 22:15:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 22:15:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 60 states have internal predecessors, (106), 19 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) Word has length 70 [2025-01-09 22:15:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:59,919 INFO L225 Difference]: With dead ends: 340 [2025-01-09 22:15:59,919 INFO L226 Difference]: Without dead ends: 340 [2025-01-09 22:15:59,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3351 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1430, Invalid=10780, Unknown=0, NotChecked=0, Total=12210 [2025-01-09 22:15:59,925 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 281 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:59,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1637 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 22:15:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-09 22:15:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 332. [2025-01-09 22:15:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 265 states have (on average 1.139622641509434) internal successors, (302), 275 states have internal predecessors, (302), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 22:15:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 376 transitions. [2025-01-09 22:15:59,958 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 376 transitions. Word has length 70 [2025-01-09 22:15:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:59,958 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 376 transitions. [2025-01-09 22:15:59,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 60 states have internal predecessors, (106), 19 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 22:15:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 376 transitions. [2025-01-09 22:15:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 22:15:59,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:59,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:59,983 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-01-09 22:16:00,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:00,168 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:16:00,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1292396174, now seen corresponding path program 1 times [2025-01-09 22:16:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:00,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158633885] [2025-01-09 22:16:00,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:00,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:00,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 22:16:00,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 22:16:00,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:00,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:16:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158633885] [2025-01-09 22:16:03,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158633885] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541403915] [2025-01-09 22:16:03,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:03,362 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-01-09 22:16:03,364 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-01-09 22:16:03,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 22:16:03,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 22:16:03,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:03,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:03,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-01-09 22:16:03,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:03,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:16:03,584 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 7 treesize of output 6 [2025-01-09 22:16:03,675 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-01-09 22:16:03,675 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 16 treesize of output 18 [2025-01-09 22:16:03,715 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 15 treesize of output 10 [2025-01-09 22:16:03,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-09 22:16:03,800 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 12 treesize of output 11 [2025-01-09 22:16:03,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2025-01-09 22:16:03,956 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 0 case distinctions, treesize of input 25 treesize of output 14 [2025-01-09 22:16:04,147 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_upsweep_~right_55 Int) (v_upsweep_~a.offset_57 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_upsweep_#in~a.base| (let ((.cse0 (+ v_upsweep_~a.offset_57 (* v_upsweep_~right_55 4)))) (store (select |c_old(#memory_int#1)| |c_upsweep_#in~a.base|) .cse0 (select (select |c_#memory_int#1| |c_upsweep_#in~a.base|) .cse0))))) (<= |c_upsweep_#in~right| v_upsweep_~right_55) (<= |c_upsweep_#in~a.offset| v_upsweep_~a.offset_57))) is different from true [2025-01-09 22:16:04,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2025-01-09 22:16:04,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2025-01-09 22:16:04,597 WARN L873 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int)) (and (<= downsweep_~left |c_downsweep_#in~left|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int#1)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 (select (select |c_#memory_int#1| |c_downsweep_#in~a.base|) .cse2))))))) is different from true [2025-01-09 22:16:04,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 90 [2025-01-09 22:16:05,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 125 [2025-01-09 22:16:05,417 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 10 [2025-01-09 22:16:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:16:05,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541403915] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:14,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:16:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 59 [2025-01-09 22:16:14,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970689188] [2025-01-09 22:16:14,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:16:14,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-01-09 22:16:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:14,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-01-09 22:16:14,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3669, Unknown=3, NotChecked=246, Total=4160 [2025-01-09 22:16:14,210 INFO L87 Difference]: Start difference. First operand 332 states and 376 transitions. Second operand has 59 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 51 states have internal predecessors, (100), 8 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-09 22:16:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:17,827 INFO L93 Difference]: Finished difference Result 410 states and 471 transitions. [2025-01-09 22:16:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 22:16:17,828 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 51 states have internal predecessors, (100), 8 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 71 [2025-01-09 22:16:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:17,829 INFO L225 Difference]: With dead ends: 410 [2025-01-09 22:16:17,829 INFO L226 Difference]: Without dead ends: 410 [2025-01-09 22:16:17,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=518, Invalid=7677, Unknown=3, NotChecked=358, Total=8556 [2025-01-09 22:16:17,831 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 192 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:17,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1110 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2287 Invalid, 0 Unknown, 286 Unchecked, 1.7s Time] [2025-01-09 22:16:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-01-09 22:16:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 339. [2025-01-09 22:16:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 272 states have (on average 1.1360294117647058) internal successors, (309), 282 states have internal predecessors, (309), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 22:16:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 383 transitions. [2025-01-09 22:16:17,853 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 383 transitions. Word has length 71 [2025-01-09 22:16:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:17,853 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 383 transitions. [2025-01-09 22:16:17,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 51 states have internal predecessors, (100), 8 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-09 22:16:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 383 transitions. [2025-01-09 22:16:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 22:16:17,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:17,856 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:17,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-01-09 22:16:18,057 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,SelfDestructingSolverStorable32 [2025-01-09 22:16:18,057 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:16:18,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash 957070741, now seen corresponding path program 1 times [2025-01-09 22:16:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415570124] [2025-01-09 22:16:18,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:18,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 22:16:18,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 22:16:18,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:16:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415570124] [2025-01-09 22:16:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415570124] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453471548] [2025-01-09 22:16:18,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:18,223 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-01-09 22:16:18,225 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-01-09 22:16:18,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 22:16:18,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 22:16:18,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:18,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:18,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:16:18,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:16:18,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:16:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453471548] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:16:18,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:16:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2025-01-09 22:16:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394066111] [2025-01-09 22:16:18,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:16:18,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:16:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:18,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:16:18,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:16:18,535 INFO L87 Difference]: Start difference. First operand 339 states and 383 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:16:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:18,653 INFO L93 Difference]: Finished difference Result 343 states and 387 transitions. [2025-01-09 22:16:18,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:16:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2025-01-09 22:16:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:18,656 INFO L225 Difference]: With dead ends: 343 [2025-01-09 22:16:18,656 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 22:16:18,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 141 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:16:18,656 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:18,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 812 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 22:16:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-01-09 22:16:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 276 states have (on average 1.1340579710144927) internal successors, (313), 286 states have internal predecessors, (313), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 22:16:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 387 transitions. [2025-01-09 22:16:18,678 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 387 transitions. Word has length 75 [2025-01-09 22:16:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:18,678 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 387 transitions. [2025-01-09 22:16:18,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:16:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 387 transitions. [2025-01-09 22:16:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:16:18,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:18,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:18,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-01-09 22:16:18,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-09 22:16:18,881 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:16:18,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:18,882 INFO L85 PathProgramCache]: Analyzing trace with hash 622629525, now seen corresponding path program 1 times [2025-01-09 22:16:18,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:18,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159616166] [2025-01-09 22:16:18,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:18,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:18,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 22:16:18,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:16:18,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:18,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:16:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159616166] [2025-01-09 22:16:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159616166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:18,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:18,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933848140] [2025-01-09 22:16:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:18,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:18,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:18,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:18,938 INFO L87 Difference]: Start difference. First operand 343 states and 387 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:16:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:18,973 INFO L93 Difference]: Finished difference Result 342 states and 386 transitions. [2025-01-09 22:16:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:16:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 77 [2025-01-09 22:16:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:18,975 INFO L225 Difference]: With dead ends: 342 [2025-01-09 22:16:18,975 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 22:16:18,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:18,975 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:18,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 198 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:16:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 22:16:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-01-09 22:16:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 276 states have (on average 1.1304347826086956) internal successors, (312), 285 states have internal predecessors, (312), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 22:16:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 386 transitions. [2025-01-09 22:16:18,985 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 386 transitions. Word has length 77 [2025-01-09 22:16:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:18,986 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 386 transitions. [2025-01-09 22:16:18,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:16:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 386 transitions. [2025-01-09 22:16:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 22:16:18,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:18,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:18,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 22:16:18,987 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:16:18,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1207416182, now seen corresponding path program 1 times [2025-01-09 22:16:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135201852] [2025-01-09 22:16:18,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:18,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 22:16:19,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 22:16:19,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:19,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:16:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135201852] [2025-01-09 22:16:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135201852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608596598] [2025-01-09 22:16:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:19,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:19,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:19,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:19,038 INFO L87 Difference]: Start difference. First operand 342 states and 386 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:16:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:19,069 INFO L93 Difference]: Finished difference Result 341 states and 385 transitions. [2025-01-09 22:16:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:16:19,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 80 [2025-01-09 22:16:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:19,071 INFO L225 Difference]: With dead ends: 341 [2025-01-09 22:16:19,072 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 22:16:19,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:19,072 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:19,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 196 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:16:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 22:16:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-01-09 22:16:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 276 states have (on average 1.1268115942028984) internal successors, (311), 284 states have internal predecessors, (311), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 22:16:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 385 transitions. [2025-01-09 22:16:19,084 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 385 transitions. Word has length 80 [2025-01-09 22:16:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:19,085 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 385 transitions. [2025-01-09 22:16:19,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:16:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 385 transitions. [2025-01-09 22:16:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 22:16:19,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:19,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:19,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 22:16:19,087 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:16:19,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1224804185, now seen corresponding path program 1 times [2025-01-09 22:16:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:19,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379653511] [2025-01-09 22:16:19,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:19,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 22:16:19,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 22:16:19,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:19,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:16:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379653511] [2025-01-09 22:16:19,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379653511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:19,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101378040] [2025-01-09 22:16:19,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:19,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:19,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:19,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:19,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:19,215 INFO L87 Difference]: Start difference. First operand 341 states and 385 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:16:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:19,293 INFO L93 Difference]: Finished difference Result 340 states and 384 transitions. [2025-01-09 22:16:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:16:19,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 81 [2025-01-09 22:16:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:19,295 INFO L225 Difference]: With dead ends: 340 [2025-01-09 22:16:19,295 INFO L226 Difference]: Without dead ends: 340 [2025-01-09 22:16:19,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:19,298 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:19,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-09 22:16:19,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-01-09 22:16:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 276 states have (on average 1.1231884057971016) internal successors, (310), 283 states have internal predecessors, (310), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 22:16:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 384 transitions. [2025-01-09 22:16:19,307 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 384 transitions. Word has length 81 [2025-01-09 22:16:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:19,307 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 384 transitions. [2025-01-09 22:16:19,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:16:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 384 transitions. [2025-01-09 22:16:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 22:16:19,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:19,308 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 3, 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, 1, 1, 1, 1, 1] [2025-01-09 22:16:19,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 22:16:19,308 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:16:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 368681227, now seen corresponding path program 2 times [2025-01-09 22:16:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:19,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464153959] [2025-01-09 22:16:19,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:16:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:19,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-09 22:16:19,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 22:16:19,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:16:19,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-01-09 22:16:19,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:19,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464153959] [2025-01-09 22:16:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464153959] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:19,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711065489] [2025-01-09 22:16:19,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:16:19,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:19,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:19,447 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:19,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-01-09 22:16:19,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-09 22:16:19,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 22:16:19,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:16:19,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:19,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:16:19,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 22:16:19,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-01-09 22:16:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711065489] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:16:19,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:16:19,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 22:16:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065814595] [2025-01-09 22:16:19,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:16:19,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:16:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:19,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:16:19,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:19,775 INFO L87 Difference]: Start difference. First operand 340 states and 384 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 22:16:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:19,846 INFO L93 Difference]: Finished difference Result 413 states and 477 transitions. [2025-01-09 22:16:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:16:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2025-01-09 22:16:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:19,848 INFO L225 Difference]: With dead ends: 413 [2025-01-09 22:16:19,848 INFO L226 Difference]: Without dead ends: 413 [2025-01-09 22:16:19,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:16:19,850 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 10 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:19,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 444 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-09 22:16:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 403. [2025-01-09 22:16:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 322 states have (on average 1.1118012422360248) internal successors, (358), 333 states have internal predecessors, (358), 46 states have call successors, (46), 24 states have call predecessors, (46), 28 states have return successors, (64), 45 states have call predecessors, (64), 46 states have call successors, (64) [2025-01-09 22:16:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 468 transitions. [2025-01-09 22:16:19,866 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 468 transitions. Word has length 91 [2025-01-09 22:16:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:19,867 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 468 transitions. [2025-01-09 22:16:19,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 22:16:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 468 transitions. [2025-01-09 22:16:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 22:16:19,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:19,868 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:19,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-01-09 22:16:20,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 22:16:20,069 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:16:20,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash 695473897, now seen corresponding path program 3 times [2025-01-09 22:16:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862701265] [2025-01-09 22:16:20,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:16:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:20,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 9 equivalence classes. [2025-01-09 22:16:20,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 52 of 85 statements. [2025-01-09 22:16:20,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:16:20,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:16:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862701265] [2025-01-09 22:16:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862701265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140436616] [2025-01-09 22:16:20,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:16:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:20,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:20,341 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:20,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-01-09 22:16:20,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 9 equivalence classes. [2025-01-09 22:16:20,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 52 of 85 statements. [2025-01-09 22:16:20,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:16:20,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:20,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:16:20,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:20,903 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-01-09 22:16:21,485 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 19 treesize of output 15 [2025-01-09 22:16:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-01-09 22:16:21,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 22:16:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140436616] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:16:22,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:16:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 38 [2025-01-09 22:16:22,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210825979] [2025-01-09 22:16:22,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:16:22,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 22:16:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:22,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 22:16:22,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 22:16:22,306 INFO L87 Difference]: Start difference. First operand 403 states and 468 transitions. Second operand has 38 states, 33 states have (on average 2.303030303030303) internal successors, (76), 35 states have internal predecessors, (76), 12 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-09 22:16:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:23,267 INFO L93 Difference]: Finished difference Result 524 states and 596 transitions. [2025-01-09 22:16:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:16:23,268 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 2.303030303030303) internal successors, (76), 35 states have internal predecessors, (76), 12 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 85 [2025-01-09 22:16:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:23,269 INFO L225 Difference]: With dead ends: 524 [2025-01-09 22:16:23,269 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 22:16:23,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=454, Invalid=2738, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 22:16:23,270 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 122 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:23,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 747 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:16:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 22:16:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 423. [2025-01-09 22:16:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 338 states have (on average 1.1094674556213018) internal successors, (375), 349 states have internal predecessors, (375), 49 states have call successors, (49), 25 states have call predecessors, (49), 29 states have return successors, (67), 48 states have call predecessors, (67), 49 states have call successors, (67) [2025-01-09 22:16:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 491 transitions. [2025-01-09 22:16:23,278 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 491 transitions. Word has length 85 [2025-01-09 22:16:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:23,278 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 491 transitions. [2025-01-09 22:16:23,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 2.303030303030303) internal successors, (76), 35 states have internal predecessors, (76), 12 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-09 22:16:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 491 transitions. [2025-01-09 22:16:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 22:16:23,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:23,279 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:23,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-01-09 22:16:23,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-09 22:16:23,481 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting upsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-01-09 22:16:23,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash 749486554, now seen corresponding path program 4 times [2025-01-09 22:16:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:23,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246289693] [2025-01-09 22:16:23,481 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:16:23,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:23,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-01-09 22:16:23,499 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 86 statements. [2025-01-09 22:16:23,499 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:16:23,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 80 proven. 77 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:16:24,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:24,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246289693] [2025-01-09 22:16:24,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246289693] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:24,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057118081] [2025-01-09 22:16:24,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:16:24,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:24,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:24,256 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:24,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-01-09 22:16:24,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-01-09 22:16:24,390 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 86 statements. [2025-01-09 22:16:24,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:16:24,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:24,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 22:16:24,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:16:24,988 INFO L312 TraceCheckSpWp]: Computing backward predicates...