./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:07:18,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:07:18,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:07:18,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:07:18,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:07:18,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:07:18,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:07:18,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:07:18,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:07:18,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:07:18,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:07:18,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:07:18,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:07:18,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:07:18,254 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:07:18,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:07:18,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:07:18,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:07:18,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:07:18,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:07:18,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:07:18,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:07:18,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:07:18,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:07:18,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:07:18,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:07:18,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:07:18,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:07:18,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:07:18,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:07:18,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:07:18,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:07:18,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:07:18,258 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 -> 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d [2025-02-06 10:07:18,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:07:18,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:07:18,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:07:18,527 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:07:18,528 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:07:18,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2025-02-06 10:07:19,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bca672101/24ff2753e5694169be4e24fa06cf973c/FLAG307abad48 [2025-02-06 10:07:20,055 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:07:20,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2025-02-06 10:07:20,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bca672101/24ff2753e5694169be4e24fa06cf973c/FLAG307abad48 [2025-02-06 10:07:20,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bca672101/24ff2753e5694169be4e24fa06cf973c [2025-02-06 10:07:20,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:07:20,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:07:20,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:07:20,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:07:20,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:07:20,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b9ba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20, skipping insertion in model container [2025-02-06 10:07:20,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:07:20,360 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:07:20,360 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:07:20,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:07:20,376 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:07:20,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:07:20,436 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:07:20,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20 WrapperNode [2025-02-06 10:07:20,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:07:20,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:07:20,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:07:20,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:07:20,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,470 INFO L138 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2025-02-06 10:07:20,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:07:20,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:07:20,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:07:20,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:07:20,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,503 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [6, 6]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-06 10:07:20,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:07:20,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:07:20,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:07:20,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:07:20,514 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (1/1) ... [2025-02-06 10:07:20,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:07:20,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:20,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:07:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:07:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:07:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:07:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:07:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:07:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:07:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:07:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:07:20,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:07:20,647 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:07:20,648 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:07:20,883 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: havoc main_#t~ret28#1.base, main_#t~ret28#1.offset;call ULTIMATE.dealloc(main_#t~malloc22#1.base, main_#t~malloc22#1.offset);havoc main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call ULTIMATE.dealloc(main_#t~malloc23#1.base, main_#t~malloc23#1.offset);havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset; [2025-02-06 10:07:20,894 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-02-06 10:07:20,894 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:07:20,901 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:07:20,902 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:07:20,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:07:20 BoogieIcfgContainer [2025-02-06 10:07:20,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:07:20,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:07:20,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:07:20,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:07:20,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:07:20" (1/3) ... [2025-02-06 10:07:20,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b93536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:07:20, skipping insertion in model container [2025-02-06 10:07:20,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:07:20" (2/3) ... [2025-02-06 10:07:20,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b93536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:07:20, skipping insertion in model container [2025-02-06 10:07:20,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:07:20" (3/3) ... [2025-02-06 10:07:20,912 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2025-02-06 10:07:20,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:07:20,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrstr-alloca-2.i that has 1 procedures, 76 locations, 1 initial locations, 6 loop locations, and 25 error locations. [2025-02-06 10:07:20,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:07:20,964 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;@7cee4581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:07:20,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-06 10:07:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 50 states have (on average 1.84) internal successors, (92), 75 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:07:20,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:20,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:20,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:20,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1695929885, now seen corresponding path program 1 times [2025-02-06 10:07:20,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:20,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296355664] [2025-02-06 10:07:20,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:20,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:21,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:07:21,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:07:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:21,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:21,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296355664] [2025-02-06 10:07:21,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296355664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:21,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:21,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:07:21,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356848777] [2025-02-06 10:07:21,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:21,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:07:21,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:21,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:07:21,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:07:21,439 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.84) internal successors, (92), 75 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:21,533 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2025-02-06 10:07:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:07:21,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:07:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:21,539 INFO L225 Difference]: With dead ends: 93 [2025-02-06 10:07:21,539 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 10:07:21,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:21,543 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 22 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:21,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 229 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 10:07:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2025-02-06 10:07:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 77 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-02-06 10:07:21,569 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 7 [2025-02-06 10:07:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:21,569 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-02-06 10:07:21,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-02-06 10:07:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:07:21,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:21,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:21,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:07:21,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:21,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1695929886, now seen corresponding path program 1 times [2025-02-06 10:07:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:21,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507725474] [2025-02-06 10:07:21,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:21,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:21,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:07:21,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:07:21,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:21,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:21,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507725474] [2025-02-06 10:07:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507725474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:21,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:21,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:07:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042037699] [2025-02-06 10:07:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:21,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:07:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:21,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:07:21,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:07:21,746 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:21,829 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2025-02-06 10:07:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:07:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:21,830 INFO L225 Difference]: With dead ends: 86 [2025-02-06 10:07:21,830 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 10:07:21,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:21,830 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 37 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:21,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 242 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 10:07:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2025-02-06 10:07:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.679245283018868) internal successors, (89), 75 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-02-06 10:07:21,835 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 7 [2025-02-06 10:07:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:21,835 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-02-06 10:07:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-02-06 10:07:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:07:21,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:21,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:07:21,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:21,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1695006364, now seen corresponding path program 1 times [2025-02-06 10:07:21,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:21,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380691795] [2025-02-06 10:07:21,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:21,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:07:21,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:07:21,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:21,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:22,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:22,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380691795] [2025-02-06 10:07:22,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380691795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:22,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:07:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825119936] [2025-02-06 10:07:22,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:22,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:07:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:22,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:07:22,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:22,021 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:22,088 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-02-06 10:07:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:22,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:07:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:22,089 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:07:22,090 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:07:22,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:22,091 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 34 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:22,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 192 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:07:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2025-02-06 10:07:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2025-02-06 10:07:22,097 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 7 [2025-02-06 10:07:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:22,098 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2025-02-06 10:07:22,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2025-02-06 10:07:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:07:22,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:22,099 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:22,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:07:22,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:22,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1746868293, now seen corresponding path program 1 times [2025-02-06 10:07:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:22,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652738126] [2025-02-06 10:07:22,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:22,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:07:22,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:07:22,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:22,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:22,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652738126] [2025-02-06 10:07:22,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652738126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:22,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456044656] [2025-02-06 10:07:22,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:22,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:22,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:22,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:22,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:07:22,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:07:22,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:07:22,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:22,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:22,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:07:22,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:22,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:07:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456044656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:22,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:07:22,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 10:07:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944620986] [2025-02-06 10:07:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:07:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:22,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:07:22,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:22,253 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:22,282 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2025-02-06 10:07:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:07:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:22,285 INFO L225 Difference]: With dead ends: 86 [2025-02-06 10:07:22,285 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 10:07:22,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:22,286 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:22,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 234 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 10:07:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2025-02-06 10:07:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.631578947368421) internal successors, (93), 79 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-02-06 10:07:22,292 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 10 [2025-02-06 10:07:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:22,292 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-02-06 10:07:22,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2025-02-06 10:07:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:07:22,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:22,292 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:22,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:07:22,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:22,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:22,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash -4057958, now seen corresponding path program 1 times [2025-02-06 10:07:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407747318] [2025-02-06 10:07:22,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:22,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:07:22,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:07:22,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:22,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407747318] [2025-02-06 10:07:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407747318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104880519] [2025-02-06 10:07:22,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:22,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:22,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:22,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:07:22,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:07:22,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:07:22,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:22,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:22,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 10:07:22,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:22,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:07:22,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-06 10:07:22,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:07:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:22,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:23,131 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:07:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104880519] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:23,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-02-06 10:07:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600051167] [2025-02-06 10:07:23,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:23,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 10:07:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:23,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 10:07:23,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:07:23,171 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:23,324 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-02-06 10:07:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:07:23,324 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:07:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:23,325 INFO L225 Difference]: With dead ends: 80 [2025-02-06 10:07:23,325 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 10:07:23,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:07:23,325 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 23 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:23,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 424 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 10:07:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-02-06 10:07:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.625) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2025-02-06 10:07:23,328 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 10 [2025-02-06 10:07:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:23,328 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2025-02-06 10:07:23,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2025-02-06 10:07:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:07:23,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:23,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:23,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:07:23,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:23,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:23,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1681652735, now seen corresponding path program 1 times [2025-02-06 10:07:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:23,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-02-06 10:07:23,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:23,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:07:23,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:07:23,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:23,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-02-06 10:07:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825343523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:23,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:23,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:07:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403833643] [2025-02-06 10:07:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:23,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:07:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:23,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:07:23,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:07:23,563 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:23,578 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-02-06 10:07:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:07:23,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:07:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:23,579 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:07:23,579 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:07:23,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:07:23,579 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 17 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:23,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 146 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:07:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2025-02-06 10:07:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 78 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2025-02-06 10:07:23,583 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 11 [2025-02-06 10:07:23,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:23,583 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2025-02-06 10:07:23,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2025-02-06 10:07:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:07:23,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:23,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:23,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:07:23,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:23,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1681652894, now seen corresponding path program 1 times [2025-02-06 10:07:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:23,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068261606] [2025-02-06 10:07:23,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:23,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:07:23,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:07:23,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:23,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:23,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:23,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068261606] [2025-02-06 10:07:23,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068261606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:23,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:23,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:07:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085792694] [2025-02-06 10:07:23,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:23,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:07:23,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:23,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:07:23,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:07:23,696 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:23,746 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2025-02-06 10:07:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:07:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:23,747 INFO L225 Difference]: With dead ends: 83 [2025-02-06 10:07:23,747 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 10:07:23,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:23,748 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:23,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 187 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 10:07:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2025-02-06 10:07:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2025-02-06 10:07:23,752 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 11 [2025-02-06 10:07:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:23,752 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2025-02-06 10:07:23,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2025-02-06 10:07:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:07:23,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:23,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:23,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:07:23,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:23,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1681652895, now seen corresponding path program 1 times [2025-02-06 10:07:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260005951] [2025-02-06 10:07:23,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:23,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:07:23,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:07:23,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:23,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:23,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260005951] [2025-02-06 10:07:23,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260005951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:23,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:07:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613126615] [2025-02-06 10:07:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:23,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:07:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:23,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:07:23,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:23,861 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:23,919 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2025-02-06 10:07:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:07:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:23,920 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:07:23,920 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:07:23,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:23,921 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:23,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 245 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:07:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2025-02-06 10:07:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.5) internal successors, (111), 93 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2025-02-06 10:07:23,924 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 11 [2025-02-06 10:07:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:23,924 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2025-02-06 10:07:23,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2025-02-06 10:07:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:07:23,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:23,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:23,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:07:23,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:23,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -870504066, now seen corresponding path program 1 times [2025-02-06 10:07:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:23,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-02-06 10:07:23,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:23,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:07:23,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:07:23,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:23,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-02-06 10:07:24,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56326566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:24,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:24,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:07:24,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789109023] [2025-02-06 10:07:24,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:24,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:07:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:24,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:07:24,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:24,064 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:24,127 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2025-02-06 10:07:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:07:24,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:07:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:24,128 INFO L225 Difference]: With dead ends: 96 [2025-02-06 10:07:24,128 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 10:07:24,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:24,129 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:24,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 230 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 10:07:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2025-02-06 10:07:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2025-02-06 10:07:24,131 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 11 [2025-02-06 10:07:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:24,131 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2025-02-06 10:07:24,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2025-02-06 10:07:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:07:24,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:24,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:24,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:07:24,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1622881177, now seen corresponding path program 1 times [2025-02-06 10:07:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-02-06 10:07:24,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:24,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:07:24,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:07:24,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:24,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-02-06 10:07:24,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36089725] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443883891] [2025-02-06 10:07:24,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:24,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:24,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:24,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:07:24,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:07:24,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:07:24,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:24,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:24,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 10:07:24,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:24,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:24,346 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-02-06 10:07:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443883891] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:24,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-02-06 10:07:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90730295] [2025-02-06 10:07:24,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:07:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:24,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:07:24,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:07:24,383 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:24,469 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2025-02-06 10:07:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:07:24,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:07:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:24,470 INFO L225 Difference]: With dead ends: 84 [2025-02-06 10:07:24,470 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 10:07:24,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:07:24,470 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 9 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:24,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 323 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 10:07:24,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2025-02-06 10:07:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.53125) internal successors, (98), 82 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2025-02-06 10:07:24,472 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 14 [2025-02-06 10:07:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:24,472 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-02-06 10:07:24,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2025-02-06 10:07:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:07:24,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:24,473 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:24,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:24,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:24,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1622881337, now seen corresponding path program 1 times [2025-02-06 10:07:24,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:24,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78881628] [2025-02-06 10:07:24,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:24,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:07:24,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:07:24,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:24,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78881628] [2025-02-06 10:07:24,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78881628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676164234] [2025-02-06 10:07:24,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:24,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:24,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:24,711 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:24,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:07:24,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:07:24,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:07:24,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:24,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:24,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:07:24,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:24,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:07:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676164234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:24,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:07:24,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 10:07:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105729899] [2025-02-06 10:07:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:24,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:07:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:24,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:07:24,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:24,800 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:24,817 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2025-02-06 10:07:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:07:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:24,818 INFO L225 Difference]: With dead ends: 105 [2025-02-06 10:07:24,818 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 10:07:24,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:24,818 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:24,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 10:07:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-02-06 10:07:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 100 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-02-06 10:07:24,824 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 14 [2025-02-06 10:07:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:24,824 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-02-06 10:07:24,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-02-06 10:07:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:07:24,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:24,825 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:24,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:25,025 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,SelfDestructingSolverStorable10 [2025-02-06 10:07:25,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:25,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -174070022, now seen corresponding path program 1 times [2025-02-06 10:07:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:25,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418880027] [2025-02-06 10:07:25,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:25,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:07:25,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:07:25,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:25,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418880027] [2025-02-06 10:07:25,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418880027] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312495224] [2025-02-06 10:07:25,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:25,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:25,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:25,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:07:25,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:07:25,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:07:25,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:25,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:25,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:07:25,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:25,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-06 10:07:25,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:07:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:25,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312495224] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:25,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:25,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-02-06 10:07:25,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69518914] [2025-02-06 10:07:25,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:25,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:07:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:25,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:07:25,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:07:25,562 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:25,699 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-02-06 10:07:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:07:25,699 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:07:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:25,700 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:07:25,700 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 10:07:25,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:07:25,701 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 16 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:25,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 386 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 10:07:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-02-06 10:07:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 80 states have (on average 1.4125) internal successors, (113), 97 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2025-02-06 10:07:25,703 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 14 [2025-02-06 10:07:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:25,703 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2025-02-06 10:07:25,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2025-02-06 10:07:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:07:25,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:25,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:25,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:07:25,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 10:07:25,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:25,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1751963896, now seen corresponding path program 1 times [2025-02-06 10:07:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:25,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525214937] [2025-02-06 10:07:25,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:25,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:25,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:07:25,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:07:25,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:25,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:25,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:25,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525214937] [2025-02-06 10:07:25,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525214937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:25,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:25,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:07:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471457751] [2025-02-06 10:07:25,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:25,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:07:25,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:25,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:07:25,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:25,973 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:26,003 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2025-02-06 10:07:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:07:26,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:07:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:26,005 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:07:26,005 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:07:26,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:26,006 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:26,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:07:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2025-02-06 10:07:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2025-02-06 10:07:26,010 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 14 [2025-02-06 10:07:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:26,010 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2025-02-06 10:07:26,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2025-02-06 10:07:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:07:26,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:26,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:26,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:07:26,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:26,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1193687241, now seen corresponding path program 1 times [2025-02-06 10:07:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478923450] [2025-02-06 10:07:26,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:26,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:07:26,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:07:26,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:26,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:26,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478923450] [2025-02-06 10:07:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478923450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:26,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:26,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:07:26,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123795164] [2025-02-06 10:07:26,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:26,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:07:26,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:26,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:07:26,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:07:26,047 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:26,080 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2025-02-06 10:07:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:07:26,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:07:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:26,081 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:07:26,081 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:07:26,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:07:26,081 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 5 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:26,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:07:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 10:07:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2025-02-06 10:07:26,083 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 17 [2025-02-06 10:07:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:26,083 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2025-02-06 10:07:26,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2025-02-06 10:07:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:07:26,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:26,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:26,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:07:26,083 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:26,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1193687240, now seen corresponding path program 1 times [2025-02-06 10:07:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:26,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163583479] [2025-02-06 10:07:26,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:26,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:07:26,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:07:26,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:26,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:26,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163583479] [2025-02-06 10:07:26,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163583479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:26,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615524343] [2025-02-06 10:07:26,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:26,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:26,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:26,241 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:26,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:07:26,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:07:26,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:07:26,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:26,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:26,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:07:26,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:26,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:26,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-06 10:07:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615524343] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:26,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:26,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-02-06 10:07:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592253610] [2025-02-06 10:07:26,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:26,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:07:26,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:26,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:07:26,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:07:26,389 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:26,457 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2025-02-06 10:07:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:07:26,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:07:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:26,458 INFO L225 Difference]: With dead ends: 88 [2025-02-06 10:07:26,458 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 10:07:26,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:07:26,459 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 7 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:26,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 345 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 10:07:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-02-06 10:07:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.408450704225352) internal successors, (100), 85 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2025-02-06 10:07:26,462 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 17 [2025-02-06 10:07:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:26,463 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2025-02-06 10:07:26,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2025-02-06 10:07:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:07:26,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:26,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:26,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:07:26,668 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,SelfDestructingSolverStorable14 [2025-02-06 10:07:26,668 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:26,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1682280718, now seen corresponding path program 1 times [2025-02-06 10:07:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586430102] [2025-02-06 10:07:26,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:26,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:07:26,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:07:26,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:26,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:26,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:26,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586430102] [2025-02-06 10:07:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586430102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:26,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:07:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443277] [2025-02-06 10:07:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:26,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:07:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:26,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:07:26,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:07:26,717 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:26,766 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2025-02-06 10:07:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:26,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:07:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:26,767 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:07:26,767 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:07:26,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:26,767 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 61 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:26,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 145 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:07:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-06 10:07:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2025-02-06 10:07:26,769 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 21 [2025-02-06 10:07:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:26,769 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2025-02-06 10:07:26,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2025-02-06 10:07:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:07:26,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:26,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:26,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:07:26,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:26,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1682280717, now seen corresponding path program 1 times [2025-02-06 10:07:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:26,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266523833] [2025-02-06 10:07:26,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:26,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:26,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:07:26,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:07:26,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:26,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:07:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:26,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266523833] [2025-02-06 10:07:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266523833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:26,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:26,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:07:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371448153] [2025-02-06 10:07:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:07:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:26,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:07:26,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:07:26,905 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:26,943 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-02-06 10:07:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:07:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:07:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:26,944 INFO L225 Difference]: With dead ends: 91 [2025-02-06 10:07:26,944 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 10:07:26,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:07:26,944 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:26,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 10:07:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 10:07:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2025-02-06 10:07:26,947 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 21 [2025-02-06 10:07:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:26,948 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2025-02-06 10:07:26,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2025-02-06 10:07:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:07:26,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:26,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:26,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:07:26,948 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1615614226, now seen corresponding path program 1 times [2025-02-06 10:07:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927318335] [2025-02-06 10:07:26,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:26,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:07:26,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:07:26,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:26,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927318335] [2025-02-06 10:07:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927318335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798904773] [2025-02-06 10:07:27,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:27,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:27,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:27,126 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:27,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:07:27,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:07:27,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:07:27,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:27,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:27,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:07:27,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:27,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:07:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:27,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:27,256 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 13 treesize of output 11 [2025-02-06 10:07:27,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 10:07:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798904773] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:27,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2025-02-06 10:07:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999798975] [2025-02-06 10:07:27,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:27,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:07:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:27,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:07:27,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:07:27,300 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:27,418 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-02-06 10:07:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:07:27,418 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:07:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:27,419 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:07:27,419 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 10:07:27,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:07:27,420 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 39 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:27,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 675 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 10:07:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2025-02-06 10:07:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.3625) internal successors, (109), 93 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2025-02-06 10:07:27,423 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 21 [2025-02-06 10:07:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:27,423 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2025-02-06 10:07:27,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2025-02-06 10:07:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:07:27,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:27,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:27,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:07:27,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:27,624 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash -611129394, now seen corresponding path program 1 times [2025-02-06 10:07:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:27,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205411651] [2025-02-06 10:07:27,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:27,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:07:27,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:07:27,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:27,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:07:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205411651] [2025-02-06 10:07:27,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205411651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:27,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:27,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:07:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851627377] [2025-02-06 10:07:27,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:27,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:07:27,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:27,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:07:27,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:07:27,721 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:27,749 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2025-02-06 10:07:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:07:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 10:07:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:27,750 INFO L225 Difference]: With dead ends: 93 [2025-02-06 10:07:27,750 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 10:07:27,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:07:27,750 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:27,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 106 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 10:07:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-06 10:07:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-02-06 10:07:27,752 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 22 [2025-02-06 10:07:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:27,752 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-02-06 10:07:27,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-02-06 10:07:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:07:27,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:27,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:27,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:07:27,753 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:27,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash 101540750, now seen corresponding path program 2 times [2025-02-06 10:07:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-02-06 10:07:27,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:27,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 10:07:27,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 24 statements. [2025-02-06 10:07:27,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:07:27,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:07:27,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:27,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-02-06 10:07:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730467196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:27,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:07:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323020215] [2025-02-06 10:07:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:27,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:07:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:27,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:07:27,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:07:27,936 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:28,043 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-02-06 10:07:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:07:28,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:07:28,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:28,044 INFO L225 Difference]: With dead ends: 73 [2025-02-06 10:07:28,045 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:07:28,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:07:28,045 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 107 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:28,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 197 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:07:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-02-06 10:07:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2025-02-06 10:07:28,047 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 24 [2025-02-06 10:07:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:28,047 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2025-02-06 10:07:28,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2025-02-06 10:07:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:07:28,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:28,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:28,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:07:28,050 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:28,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1343513942, now seen corresponding path program 1 times [2025-02-06 10:07:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122929172] [2025-02-06 10:07:28,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:28,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:07:28,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:07:28,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:28,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:28,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:28,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122929172] [2025-02-06 10:07:28,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122929172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:28,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920125160] [2025-02-06 10:07:28,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:28,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:28,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:28,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:28,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:07:28,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:07:28,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:07:28,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:28,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:28,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 10:07:28,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:28,421 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-02-06 10:07:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:28,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:28,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:28,492 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 16 treesize of output 12 [2025-02-06 10:07:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:28,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920125160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:28,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:28,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 24 [2025-02-06 10:07:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109995683] [2025-02-06 10:07:28,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:28,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:07:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:28,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:07:28,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:07:28,536 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:28,754 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2025-02-06 10:07:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:07:28,755 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:07:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:28,755 INFO L225 Difference]: With dead ends: 122 [2025-02-06 10:07:28,755 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 10:07:28,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:07:28,756 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 63 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:28,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 816 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 10:07:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 83. [2025-02-06 10:07:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 82 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2025-02-06 10:07:28,759 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 27 [2025-02-06 10:07:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:28,759 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2025-02-06 10:07:28,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2025-02-06 10:07:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:07:28,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:28,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:28,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:28,960 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash -212612219, now seen corresponding path program 1 times [2025-02-06 10:07:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804660131] [2025-02-06 10:07:28,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:28,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:07:28,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:07:28,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:28,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:29,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804660131] [2025-02-06 10:07:29,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804660131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:29,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:29,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:07:29,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609037441] [2025-02-06 10:07:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:29,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:07:29,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:29,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:07:29,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:07:29,015 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:29,053 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-02-06 10:07:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:07:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:29,054 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:07:29,054 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:07:29,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:29,057 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 40 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:29,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 131 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:07:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 10:07:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-02-06 10:07:29,059 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 30 [2025-02-06 10:07:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:29,059 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-02-06 10:07:29,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-02-06 10:07:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:07:29,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:29,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:29,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:07:29,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:29,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash -212612218, now seen corresponding path program 1 times [2025-02-06 10:07:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:29,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890939036] [2025-02-06 10:07:29,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:29,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:07:29,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:07:29,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:29,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:29,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890939036] [2025-02-06 10:07:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890939036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99604356] [2025-02-06 10:07:29,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:29,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:29,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:29,218 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:29,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:07:29,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:07:29,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:07:29,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:29,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:29,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 10:07:29,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:29,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:29,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-06 10:07:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:29,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99604356] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:29,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:29,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-02-06 10:07:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541207676] [2025-02-06 10:07:29,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:29,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:07:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:29,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:07:29,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:07:29,451 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:29,528 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2025-02-06 10:07:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:07:29,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:07:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:29,529 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:07:29,529 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:07:29,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:07:29,530 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:29,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 254 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:07:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2025-02-06 10:07:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 84 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2025-02-06 10:07:29,531 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 30 [2025-02-06 10:07:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2025-02-06 10:07:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2025-02-06 10:07:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:07:29,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:29,532 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:29,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:07:29,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:29,737 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:29,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1329288494, now seen corresponding path program 2 times [2025-02-06 10:07:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105338790] [2025-02-06 10:07:29,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:29,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 10:07:29,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:07:29,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105338790] [2025-02-06 10:07:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105338790] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825312554] [2025-02-06 10:07:29,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:29,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:29,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:29,989 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:29,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:07:30,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 10:07:30,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:07:30,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:30,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:30,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 10:07:30,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:30,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:30,234 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-02-06 10:07:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:07:30,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825312554] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:30,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-02-06 10:07:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709344693] [2025-02-06 10:07:30,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:30,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:07:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:30,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:07:30,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:07:30,350 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:30,653 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2025-02-06 10:07:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:07:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:07:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:30,654 INFO L225 Difference]: With dead ends: 131 [2025-02-06 10:07:30,654 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 10:07:30,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:07:30,655 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 83 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:30,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 695 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:07:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 10:07:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2025-02-06 10:07:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 87 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2025-02-06 10:07:30,657 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 30 [2025-02-06 10:07:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:30,657 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2025-02-06 10:07:30,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2025-02-06 10:07:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:07:30,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:30,657 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:30,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:30,857 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,SelfDestructingSolverStorable23 [2025-02-06 10:07:30,858 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:30,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1235048558, now seen corresponding path program 3 times [2025-02-06 10:07:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-02-06 10:07:30,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:30,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:30,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-02-06 10:07:30,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 33 statements. [2025-02-06 10:07:30,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:07:30,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:07:31,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-02-06 10:07:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111709569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862964142] [2025-02-06 10:07:31,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:31,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:31,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:31,083 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:31,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:07:31,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-02-06 10:07:31,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 33 statements. [2025-02-06 10:07:31,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:07:31,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:31,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 10:07:31,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:31,184 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 14 treesize of output 10 [2025-02-06 10:07:31,500 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-02-06 10:07:31,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2025-02-06 10:07:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:31,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:32,033 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 40 treesize of output 34 [2025-02-06 10:07:32,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:07:32,051 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 64 treesize of output 82 [2025-02-06 10:07:32,062 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 15 treesize of output 11 [2025-02-06 10:07:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:07:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862964142] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:32,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2025-02-06 10:07:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038618998] [2025-02-06 10:07:32,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:32,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:07:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:32,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:07:32,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:07:32,105 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:33,155 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2025-02-06 10:07:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:07:33,155 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-06 10:07:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:33,155 INFO L225 Difference]: With dead ends: 88 [2025-02-06 10:07:33,155 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 10:07:33,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 10:07:33,156 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 189 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:33,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 551 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:07:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 10:07:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2025-02-06 10:07:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.295774647887324) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-02-06 10:07:33,158 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 33 [2025-02-06 10:07:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:33,158 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-02-06 10:07:33,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-02-06 10:07:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:07:33,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:33,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:33,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:33,363 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,SelfDestructingSolverStorable24 [2025-02-06 10:07:33,363 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:33,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1955988300, now seen corresponding path program 1 times [2025-02-06 10:07:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:33,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353145995] [2025-02-06 10:07:33,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:33,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:07:33,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:07:33,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:33,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:07:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:33,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353145995] [2025-02-06 10:07:33,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353145995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:33,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:33,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:07:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100842365] [2025-02-06 10:07:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:33,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:07:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:33,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:07:33,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:07:33,483 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:33,529 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2025-02-06 10:07:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:07:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 10:07:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:33,530 INFO L225 Difference]: With dead ends: 117 [2025-02-06 10:07:33,530 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 10:07:33,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:07:33,531 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:33,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 10:07:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 10:07:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2025-02-06 10:07:33,532 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 35 [2025-02-06 10:07:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:33,532 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-02-06 10:07:33,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2025-02-06 10:07:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:07:33,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:33,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:33,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:07:33,533 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:33,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:33,533 INFO L85 PathProgramCache]: Analyzing trace with hash -227688627, now seen corresponding path program 1 times [2025-02-06 10:07:33,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:33,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549871659] [2025-02-06 10:07:33,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:33,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:07:33,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:07:33,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:33,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549871659] [2025-02-06 10:07:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549871659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995064668] [2025-02-06 10:07:33,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:33,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:33,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:33,701 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:33,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:07:33,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:07:33,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:07:33,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:33,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:33,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:07:33,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:33,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:07:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:33,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:33,884 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 13 treesize of output 11 [2025-02-06 10:07:33,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 10:07:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995064668] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:33,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:33,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-02-06 10:07:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682454154] [2025-02-06 10:07:33,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:33,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:07:33,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:33,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:07:33,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:07:33,938 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:34,028 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2025-02-06 10:07:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:07:34,029 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 10:07:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:34,029 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:07:34,029 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:07:34,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:07:34,030 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:34,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 471 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:07:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-02-06 10:07:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2025-02-06 10:07:34,031 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 35 [2025-02-06 10:07:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:34,032 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2025-02-06 10:07:34,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2025-02-06 10:07:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:07:34,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:34,032 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, 1, 1, 1, 1] [2025-02-06 10:07:34,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 10:07:34,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:34,236 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:34,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash 781174117, now seen corresponding path program 2 times [2025-02-06 10:07:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:34,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619689145] [2025-02-06 10:07:34,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:34,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 10:07:34,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:07:34,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:34,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:34,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:34,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619689145] [2025-02-06 10:07:34,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619689145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304766623] [2025-02-06 10:07:34,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:34,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:34,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:34,404 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:34,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:07:34,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 10:07:34,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:07:34,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:34,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:34,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 10:07:34,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:34,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:34,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:07:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:34,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304766623] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:34,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:34,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-06 10:07:34,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384588570] [2025-02-06 10:07:34,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:34,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 10:07:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:34,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 10:07:34,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:07:34,739 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 21 states, 20 states have (on average 4.0) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:34,925 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2025-02-06 10:07:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:07:34,925 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.0) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-06 10:07:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:34,926 INFO L225 Difference]: With dead ends: 113 [2025-02-06 10:07:34,926 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 10:07:34,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:07:34,926 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 54 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:34,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 459 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 10:07:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2025-02-06 10:07:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 101 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-02-06 10:07:34,931 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 38 [2025-02-06 10:07:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:34,931 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-02-06 10:07:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.0) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-02-06 10:07:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:07:34,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:34,932 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:34,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 10:07:35,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 10:07:35,132 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash -910333020, now seen corresponding path program 1 times [2025-02-06 10:07:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487387516] [2025-02-06 10:07:35,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:35,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:07:35,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:07:35,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:35,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:07:35,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:35,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487387516] [2025-02-06 10:07:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487387516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:07:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502740808] [2025-02-06 10:07:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:35,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:07:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:35,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:07:35,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:07:35,191 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:35,227 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-02-06 10:07:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:07:35,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-06 10:07:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:35,228 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:07:35,228 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 10:07:35,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:35,229 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:35,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 106 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 10:07:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-02-06 10:07:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 99 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2025-02-06 10:07:35,233 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 40 [2025-02-06 10:07:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:35,233 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2025-02-06 10:07:35,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2025-02-06 10:07:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:07:35,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:35,234 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:35,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 10:07:35,234 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:35,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash -910333019, now seen corresponding path program 1 times [2025-02-06 10:07:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:35,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481112241] [2025-02-06 10:07:35,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:35,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:07:35,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:07:35,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:35,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481112241] [2025-02-06 10:07:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481112241] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688581496] [2025-02-06 10:07:35,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:35,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:35,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:35,369 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:35,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:07:35,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:07:35,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:07:35,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:35,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:35,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:07:35,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:35,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:35,702 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 7 treesize of output 5 [2025-02-06 10:07:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688581496] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:35,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-02-06 10:07:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442008852] [2025-02-06 10:07:35,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:35,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:07:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:35,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:07:35,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:07:35,719 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 19 states, 18 states have (on average 5.055555555555555) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:35,920 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2025-02-06 10:07:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:07:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.055555555555555) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-06 10:07:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:35,921 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:07:35,921 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 10:07:35,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:07:35,922 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 105 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:35,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 488 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:07:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 10:07:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2025-02-06 10:07:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 100 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2025-02-06 10:07:35,924 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 40 [2025-02-06 10:07:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:35,924 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2025-02-06 10:07:35,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.055555555555555) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2025-02-06 10:07:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:07:35,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:35,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:35,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:36,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:36,130 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:36,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1343296417, now seen corresponding path program 1 times [2025-02-06 10:07:36,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:36,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034295897] [2025-02-06 10:07:36,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:36,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:07:36,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:07:36,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:36,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:07:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:36,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034295897] [2025-02-06 10:07:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034295897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:36,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:36,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:07:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066024189] [2025-02-06 10:07:36,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:36,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:07:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:36,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:07:36,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:36,184 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:36,231 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2025-02-06 10:07:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:07:36,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-06 10:07:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:36,232 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:07:36,232 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 10:07:36,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:07:36,232 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 50 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:36,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 10:07:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-02-06 10:07:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 99 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2025-02-06 10:07:36,234 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 42 [2025-02-06 10:07:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:36,235 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2025-02-06 10:07:36,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2025-02-06 10:07:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:07:36,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:36,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:36,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 10:07:36,235 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:36,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1343296418, now seen corresponding path program 1 times [2025-02-06 10:07:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101426911] [2025-02-06 10:07:36,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:36,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:36,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:07:36,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:07:36,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:36,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:36,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101426911] [2025-02-06 10:07:36,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101426911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:36,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378621392] [2025-02-06 10:07:36,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:36,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:36,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:36,427 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:36,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:07:36,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:07:36,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:07:36,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:36,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:36,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:07:36,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:36,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:36,699 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 7 treesize of output 5 [2025-02-06 10:07:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:36,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378621392] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:36,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2025-02-06 10:07:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386237735] [2025-02-06 10:07:36,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:07:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:36,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:07:36,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:07:36,716 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:36,863 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2025-02-06 10:07:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:07:36,864 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-06 10:07:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:36,864 INFO L225 Difference]: With dead ends: 109 [2025-02-06 10:07:36,864 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 10:07:36,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:07:36,865 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 77 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:36,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 405 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 10:07:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2025-02-06 10:07:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 105 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2025-02-06 10:07:36,871 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 42 [2025-02-06 10:07:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:36,871 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2025-02-06 10:07:36,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2025-02-06 10:07:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:07:36,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:36,872 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:36,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:37,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:37,072 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:37,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:37,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1769364685, now seen corresponding path program 3 times [2025-02-06 10:07:37,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014828931] [2025-02-06 10:07:37,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:37,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 3 equivalence classes. [2025-02-06 10:07:37,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:07:37,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:07:37,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:37,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:37,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014828931] [2025-02-06 10:07:37,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014828931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:37,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843903153] [2025-02-06 10:07:37,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:37,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:37,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:37,359 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:37,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:07:37,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 3 equivalence classes. [2025-02-06 10:07:37,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:07:37,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:07:37,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:37,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 10:07:37,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:37,553 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-02-06 10:07:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:37,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:37,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:37,636 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 16 treesize of output 12 [2025-02-06 10:07:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843903153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:37,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 27 [2025-02-06 10:07:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076995477] [2025-02-06 10:07:37,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:37,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:07:37,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:37,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:07:37,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:07:37,709 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:37,905 INFO L93 Difference]: Finished difference Result 179 states and 208 transitions. [2025-02-06 10:07:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:07:37,905 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-06 10:07:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:37,909 INFO L225 Difference]: With dead ends: 179 [2025-02-06 10:07:37,909 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 10:07:37,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:07:37,909 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 51 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:37,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 903 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 10:07:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2025-02-06 10:07:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 161 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2025-02-06 10:07:37,912 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 43 [2025-02-06 10:07:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:37,912 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2025-02-06 10:07:37,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2025-02-06 10:07:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:07:37,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:37,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:37,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-06 10:07:38,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:38,113 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:38,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1877299246, now seen corresponding path program 1 times [2025-02-06 10:07:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:38,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887692028] [2025-02-06 10:07:38,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:38,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:38,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:07:38,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:07:38,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:38,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:07:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887692028] [2025-02-06 10:07:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887692028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:38,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:07:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458959211] [2025-02-06 10:07:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:38,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:07:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:38,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:07:38,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:38,162 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:38,209 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2025-02-06 10:07:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:07:38,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-06 10:07:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:38,210 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:07:38,210 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 10:07:38,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:07:38,211 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 40 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:38,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 138 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 10:07:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2025-02-06 10:07:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 160 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 190 transitions. [2025-02-06 10:07:38,213 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 190 transitions. Word has length 44 [2025-02-06 10:07:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:38,213 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 190 transitions. [2025-02-06 10:07:38,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 190 transitions. [2025-02-06 10:07:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:07:38,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:38,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:38,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 10:07:38,213 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:38,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1877299245, now seen corresponding path program 1 times [2025-02-06 10:07:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046993911] [2025-02-06 10:07:38,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:38,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:07:38,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:07:38,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:38,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:38,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:38,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046993911] [2025-02-06 10:07:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046993911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:38,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721376303] [2025-02-06 10:07:38,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:38,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:38,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:38,351 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:38,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:07:38,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:07:38,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:07:38,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:38,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:38,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 10:07:38,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:38,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:38,672 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 7 treesize of output 5 [2025-02-06 10:07:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:38,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721376303] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:38,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:38,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-06 10:07:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404068463] [2025-02-06 10:07:38,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:38,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 10:07:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:38,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 10:07:38,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:07:38,687 INFO L87 Difference]: Start difference. First operand 161 states and 190 transitions. Second operand has 21 states, 20 states have (on average 4.95) internal successors, (99), 21 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:38,894 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2025-02-06 10:07:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:07:38,894 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.95) internal successors, (99), 21 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-06 10:07:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:38,895 INFO L225 Difference]: With dead ends: 171 [2025-02-06 10:07:38,895 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 10:07:38,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:07:38,895 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 46 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:38,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 461 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 10:07:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2025-02-06 10:07:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.206451612903226) internal successors, (187), 159 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2025-02-06 10:07:38,898 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 44 [2025-02-06 10:07:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:38,898 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2025-02-06 10:07:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.95) internal successors, (99), 21 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2025-02-06 10:07:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:07:38,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:38,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:38,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:07:39,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:39,099 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash -459486491, now seen corresponding path program 4 times [2025-02-06 10:07:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999256581] [2025-02-06 10:07:39,099 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:39,104 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:07:39,111 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 46 statements. [2025-02-06 10:07:39,111 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:07:39,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:07:39,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999256581] [2025-02-06 10:07:39,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999256581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031860544] [2025-02-06 10:07:39,826 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:39,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:39,828 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:39,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:07:39,889 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:07:39,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 46 statements. [2025-02-06 10:07:39,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:07:39,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:39,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 10:07:39,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:39,981 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 14 treesize of output 10 [2025-02-06 10:07:40,380 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-02-06 10:07:40,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2025-02-06 10:07:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:07:40,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:40,882 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 29 treesize of output 25 [2025-02-06 10:07:40,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-02-06 10:07:41,103 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 49 treesize of output 41 [2025-02-06 10:07:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:07:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031860544] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:41,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:41,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 44 [2025-02-06 10:07:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139131544] [2025-02-06 10:07:41,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:41,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 10:07:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:41,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 10:07:41,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1788, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 10:07:41,140 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:41,653 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2025-02-06 10:07:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:07:41,654 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 10:07:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:41,654 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:07:41,654 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 10:07:41,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=2355, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 10:07:41,655 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 144 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:41,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 686 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:07:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 10:07:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2025-02-06 10:07:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 135 states have (on average 1.1777777777777778) internal successors, (159), 138 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2025-02-06 10:07:41,657 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 46 [2025-02-06 10:07:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:41,658 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2025-02-06 10:07:41,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2025-02-06 10:07:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:07:41,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:41,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:41,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:07:41,858 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,SelfDestructingSolverStorable35 [2025-02-06 10:07:41,859 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:41,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash -198361125, now seen corresponding path program 1 times [2025-02-06 10:07:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457852731] [2025-02-06 10:07:41,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:41,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:07:41,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:07:41,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:07:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457852731] [2025-02-06 10:07:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457852731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:41,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:41,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:07:41,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011782866] [2025-02-06 10:07:41,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:41,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:07:41,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:41,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:07:41,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:41,909 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:41,955 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2025-02-06 10:07:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:07:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 10:07:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:41,955 INFO L225 Difference]: With dead ends: 139 [2025-02-06 10:07:41,955 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 10:07:41,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:07:41,956 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:41,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 130 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 10:07:41,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2025-02-06 10:07:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 135 states have (on average 1.162962962962963) internal successors, (157), 137 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2025-02-06 10:07:41,958 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 46 [2025-02-06 10:07:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:41,958 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2025-02-06 10:07:41,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2025-02-06 10:07:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:07:41,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:41,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:41,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 10:07:41,958 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:41,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -198361124, now seen corresponding path program 1 times [2025-02-06 10:07:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370190099] [2025-02-06 10:07:41,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:41,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:07:41,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:07:41,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:41,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:42,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:42,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370190099] [2025-02-06 10:07:42,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370190099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:42,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27072618] [2025-02-06 10:07:42,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:42,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:42,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:42,138 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:42,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:07:42,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:07:42,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:07:42,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:42,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:42,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 10:07:42,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:42,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:42,503 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 7 treesize of output 5 [2025-02-06 10:07:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27072618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:42,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:42,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2025-02-06 10:07:42,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955481987] [2025-02-06 10:07:42,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:42,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 10:07:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:42,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 10:07:42,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:07:42,523 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 22 states, 21 states have (on average 4.476190476190476) internal successors, (94), 22 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:42,699 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2025-02-06 10:07:42,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:07:42,702 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.476190476190476) internal successors, (94), 22 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 10:07:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:42,703 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:07:42,703 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:07:42,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:07:42,703 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 75 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:42,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 376 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:07:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2025-02-06 10:07:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.1642857142857144) internal successors, (163), 142 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2025-02-06 10:07:42,705 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 46 [2025-02-06 10:07:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2025-02-06 10:07:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.476190476190476) internal successors, (94), 22 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2025-02-06 10:07:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:07:42,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:42,708 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:42,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:42,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:42,909 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:42,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:42,909 INFO L85 PathProgramCache]: Analyzing trace with hash 815730981, now seen corresponding path program 1 times [2025-02-06 10:07:42,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:42,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969019064] [2025-02-06 10:07:42,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:42,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:42,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:07:42,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:07:42,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:42,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:43,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969019064] [2025-02-06 10:07:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969019064] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849945113] [2025-02-06 10:07:43,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:43,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:43,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:43,093 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:43,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:07:43,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:07:43,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:07:43,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:43,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:43,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 10:07:43,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:43,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:43,543 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 7 treesize of output 5 [2025-02-06 10:07:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:43,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849945113] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:43,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:43,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-02-06 10:07:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154686617] [2025-02-06 10:07:43,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:43,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:07:43,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:43,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:07:43,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:07:43,566 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 23 states, 22 states have (on average 4.863636363636363) internal successors, (107), 23 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:43,858 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2025-02-06 10:07:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:07:43,859 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.863636363636363) internal successors, (107), 23 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-06 10:07:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:43,859 INFO L225 Difference]: With dead ends: 206 [2025-02-06 10:07:43,859 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 10:07:43,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:07:43,860 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 82 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:43,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 993 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:07:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 10:07:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 174. [2025-02-06 10:07:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 171 states have (on average 1.1871345029239766) internal successors, (203), 173 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 203 transitions. [2025-02-06 10:07:43,863 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 203 transitions. Word has length 48 [2025-02-06 10:07:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:43,863 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 203 transitions. [2025-02-06 10:07:43,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.863636363636363) internal successors, (107), 23 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 203 transitions. [2025-02-06 10:07:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:07:43,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:43,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:43,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:44,070 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,SelfDestructingSolverStorable38 [2025-02-06 10:07:44,070 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:44,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1598766069, now seen corresponding path program 1 times [2025-02-06 10:07:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168053410] [2025-02-06 10:07:44,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:44,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:07:44,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:07:44,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:44,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:07:44,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:44,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168053410] [2025-02-06 10:07:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168053410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:44,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:44,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 10:07:44,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309696506] [2025-02-06 10:07:44,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:07:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:44,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:07:44,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:07:44,208 INFO L87 Difference]: Start difference. First operand 174 states and 203 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:44,335 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2025-02-06 10:07:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:07:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-06 10:07:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:44,337 INFO L225 Difference]: With dead ends: 256 [2025-02-06 10:07:44,337 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 10:07:44,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:07:44,338 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:44,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 400 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:07:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 10:07:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2025-02-06 10:07:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 224 states have (on average 1.1830357142857142) internal successors, (265), 226 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 265 transitions. [2025-02-06 10:07:44,341 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 265 transitions. Word has length 48 [2025-02-06 10:07:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:44,341 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 265 transitions. [2025-02-06 10:07:44,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 265 transitions. [2025-02-06 10:07:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:07:44,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:44,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:44,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 10:07:44,342 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:44,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash 220566413, now seen corresponding path program 2 times [2025-02-06 10:07:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:44,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977065216] [2025-02-06 10:07:44,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:44,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-06 10:07:44,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 53 statements. [2025-02-06 10:07:44,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:07:44,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 10:07:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977065216] [2025-02-06 10:07:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977065216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:07:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:07:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:07:44,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367766247] [2025-02-06 10:07:44,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:07:44,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:07:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:44,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:07:44,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:07:44,396 INFO L87 Difference]: Start difference. First operand 227 states and 265 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:44,419 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2025-02-06 10:07:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:07:44,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-06 10:07:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:44,420 INFO L225 Difference]: With dead ends: 201 [2025-02-06 10:07:44,420 INFO L226 Difference]: Without dead ends: 162 [2025-02-06 10:07:44,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:07:44,420 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 245 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-02-06 10:07:44,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 245 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:07:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-06 10:07:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-06 10:07:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 1.1886792452830188) internal successors, (189), 161 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2025-02-06 10:07:44,424 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 53 [2025-02-06 10:07:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:44,425 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2025-02-06 10:07:44,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2025-02-06 10:07:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:07:44,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:44,425 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 10:07:44,425 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:44,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2098386809, now seen corresponding path program 1 times [2025-02-06 10:07:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586909754] [2025-02-06 10:07:44,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:44,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:07:44,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:07:44,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:44,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:07:44,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586909754] [2025-02-06 10:07:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586909754] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746368710] [2025-02-06 10:07:44,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:44,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:44,509 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:44,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:07:44,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:07:44,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:07:44,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:44,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:44,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-06 10:07:44,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:44,671 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-02-06 10:07:44,684 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 8 treesize of output 1 [2025-02-06 10:07:44,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 10:07:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:07:44,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:45,045 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 14 [2025-02-06 10:07:45,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:45,049 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 16 treesize of output 12 [2025-02-06 10:07:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:07:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746368710] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:45,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:45,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 18] total 35 [2025-02-06 10:07:45,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105093935] [2025-02-06 10:07:45,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:45,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:07:45,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:45,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:07:45,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:07:45,107 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand has 35 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:45,577 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2025-02-06 10:07:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 10:07:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-06 10:07:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:45,578 INFO L225 Difference]: With dead ends: 237 [2025-02-06 10:07:45,578 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 10:07:45,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=2418, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 10:07:45,579 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 70 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:45,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 920 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:07:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 10:07:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2025-02-06 10:07:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 172 states have (on average 1.191860465116279) internal successors, (205), 174 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 205 transitions. [2025-02-06 10:07:45,582 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 205 transitions. Word has length 54 [2025-02-06 10:07:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:45,582 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 205 transitions. [2025-02-06 10:07:45,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2025-02-06 10:07:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 10:07:45,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:45,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:45,589 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-02-06 10:07:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-02-06 10:07:45,785 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1033897207, now seen corresponding path program 1 times [2025-02-06 10:07:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973860005] [2025-02-06 10:07:45,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:45,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:07:45,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:07:45,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:45,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:46,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:46,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973860005] [2025-02-06 10:07:46,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973860005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:46,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340376917] [2025-02-06 10:07:46,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:46,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:46,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:46,058 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:46,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 10:07:46,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:07:46,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:07:46,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:46,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:46,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 10:07:46,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:46,235 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-02-06 10:07:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:46,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:46,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:46,565 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 16 treesize of output 12 [2025-02-06 10:07:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:46,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340376917] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:46,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 38 [2025-02-06 10:07:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252059647] [2025-02-06 10:07:46,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:07:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:46,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:07:46,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:07:46,615 INFO L87 Difference]: Start difference. First operand 175 states and 205 transitions. Second operand has 38 states, 38 states have (on average 3.1842105263157894) internal successors, (121), 38 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:46,933 INFO L93 Difference]: Finished difference Result 333 states and 383 transitions. [2025-02-06 10:07:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:07:46,933 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.1842105263157894) internal successors, (121), 38 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-06 10:07:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:46,934 INFO L225 Difference]: With dead ends: 333 [2025-02-06 10:07:46,934 INFO L226 Difference]: Without dead ends: 268 [2025-02-06 10:07:46,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 10:07:46,935 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 85 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:46,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1671 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:07:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-06 10:07:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2025-02-06 10:07:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 257 states have (on average 1.1867704280155642) internal successors, (305), 259 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2025-02-06 10:07:46,938 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 59 [2025-02-06 10:07:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:46,938 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2025-02-06 10:07:46,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.1842105263157894) internal successors, (121), 38 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2025-02-06 10:07:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 10:07:46,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:46,939 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 10:07:46,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:47,139 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,SelfDestructingSolverStorable42 [2025-02-06 10:07:47,139 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2016216333, now seen corresponding path program 2 times [2025-02-06 10:07:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586486342] [2025-02-06 10:07:47,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:47,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-06 10:07:47,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 10:07:47,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:47,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:07:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586486342] [2025-02-06 10:07:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586486342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366851148] [2025-02-06 10:07:47,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:47,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:47,372 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:47,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-06 10:07:47,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-06 10:07:47,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 10:07:47,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:47,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:47,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 10:07:47,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:07:47,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:47,763 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-02-06 10:07:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:07:47,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366851148] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:47,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:47,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-02-06 10:07:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591685636] [2025-02-06 10:07:47,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:47,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:07:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:47,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:07:47,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:07:47,848 INFO L87 Difference]: Start difference. First operand 260 states and 305 transitions. Second operand has 27 states, 26 states have (on average 4.769230769230769) internal successors, (124), 27 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:48,084 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2025-02-06 10:07:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:07:48,085 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.769230769230769) internal successors, (124), 27 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-06 10:07:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:48,086 INFO L225 Difference]: With dead ends: 289 [2025-02-06 10:07:48,086 INFO L226 Difference]: Without dead ends: 289 [2025-02-06 10:07:48,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:07:48,086 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 82 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:48,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 577 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:07:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-06 10:07:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 270. [2025-02-06 10:07:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 267 states have (on average 1.1947565543071161) internal successors, (319), 269 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 319 transitions. [2025-02-06 10:07:48,089 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 319 transitions. Word has length 60 [2025-02-06 10:07:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:48,089 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 319 transitions. [2025-02-06 10:07:48,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.769230769230769) internal successors, (124), 27 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 319 transitions. [2025-02-06 10:07:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:07:48,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:48,090 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:48,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-06 10:07:48,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:48,294 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:48,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:48,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1093191391, now seen corresponding path program 2 times [2025-02-06 10:07:48,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:48,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686041894] [2025-02-06 10:07:48,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:48,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:48,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-06 10:07:48,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:07:48,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:48,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686041894] [2025-02-06 10:07:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686041894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:48,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815286317] [2025-02-06 10:07:48,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:48,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:48,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:48,611 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:48,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-06 10:07:48,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-06 10:07:48,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:07:48,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:48,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:48,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:07:48,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:48,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:48,997 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 7 treesize of output 5 [2025-02-06 10:07:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:49,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815286317] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:49,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 30 [2025-02-06 10:07:49,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288596693] [2025-02-06 10:07:49,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:49,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:07:49,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:49,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:07:49,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:07:49,055 INFO L87 Difference]: Start difference. First operand 270 states and 319 transitions. Second operand has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:49,419 INFO L93 Difference]: Finished difference Result 375 states and 436 transitions. [2025-02-06 10:07:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:07:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-06 10:07:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:49,420 INFO L225 Difference]: With dead ends: 375 [2025-02-06 10:07:49,420 INFO L226 Difference]: Without dead ends: 375 [2025-02-06 10:07:49,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 10:07:49,421 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 273 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:49,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 720 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:07:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-06 10:07:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 324. [2025-02-06 10:07:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 321 states have (on average 1.1993769470404985) internal successors, (385), 323 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 385 transitions. [2025-02-06 10:07:49,426 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 385 transitions. Word has length 62 [2025-02-06 10:07:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:49,426 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 385 transitions. [2025-02-06 10:07:49,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 385 transitions. [2025-02-06 10:07:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:07:49,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:49,427 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:49,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-02-06 10:07:49,627 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,SelfDestructingSolverStorable44 [2025-02-06 10:07:49,628 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:49,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 553644810, now seen corresponding path program 1 times [2025-02-06 10:07:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:49,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934766904] [2025-02-06 10:07:49,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:49,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:07:49,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:07:49,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:49,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:07:49,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934766904] [2025-02-06 10:07:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934766904] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812933756] [2025-02-06 10:07:49,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:49,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:49,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:49,875 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:49,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-06 10:07:49,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:07:50,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:07:50,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:50,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:50,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:07:50,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:07:50,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:50,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:07:50,203 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-02-06 10:07:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:07:50,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812933756] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:50,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:50,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2025-02-06 10:07:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733663404] [2025-02-06 10:07:50,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:50,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:07:50,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:50,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:07:50,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:07:50,294 INFO L87 Difference]: Start difference. First operand 324 states and 385 transitions. Second operand has 25 states, 24 states have (on average 4.458333333333333) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:50,649 INFO L93 Difference]: Finished difference Result 430 states and 512 transitions. [2025-02-06 10:07:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:07:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.458333333333333) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-06 10:07:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:50,650 INFO L225 Difference]: With dead ends: 430 [2025-02-06 10:07:50,650 INFO L226 Difference]: Without dead ends: 430 [2025-02-06 10:07:50,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:07:50,651 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 192 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:50,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 688 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:07:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-06 10:07:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 389. [2025-02-06 10:07:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 386 states have (on average 1.2305699481865284) internal successors, (475), 388 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 475 transitions. [2025-02-06 10:07:50,657 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 475 transitions. Word has length 62 [2025-02-06 10:07:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:50,657 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 475 transitions. [2025-02-06 10:07:50,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.458333333333333) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 475 transitions. [2025-02-06 10:07:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:07:50,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:50,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:50,665 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-02-06 10:07:50,858 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,SelfDestructingSolverStorable45 [2025-02-06 10:07:50,859 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:50,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:50,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1483033009, now seen corresponding path program 1 times [2025-02-06 10:07:50,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:50,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069118098] [2025-02-06 10:07:50,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:50,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:50,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:07:50,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:07:50,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:50,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 10:07:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069118098] [2025-02-06 10:07:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069118098] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902175287] [2025-02-06 10:07:51,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:51,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:51,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:51,120 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-02-06 10:07:51,121 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-02-06 10:07:51,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:07:51,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:07:51,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:51,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:51,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-02-06 10:07:51,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:51,321 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-02-06 10:07:51,342 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 8 treesize of output 1 [2025-02-06 10:07:51,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 10:07:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:51,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:51,967 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 14 [2025-02-06 10:07:51,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:51,975 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 16 treesize of output 12 [2025-02-06 10:07:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:07:52,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902175287] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:52,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:52,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 20] total 44 [2025-02-06 10:07:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179940271] [2025-02-06 10:07:52,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:52,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-06 10:07:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:52,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-06 10:07:52,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:07:52,060 INFO L87 Difference]: Start difference. First operand 389 states and 475 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:53,222 INFO L93 Difference]: Finished difference Result 488 states and 575 transitions. [2025-02-06 10:07:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 10:07:53,222 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-06 10:07:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:53,223 INFO L225 Difference]: With dead ends: 488 [2025-02-06 10:07:53,223 INFO L226 Difference]: Without dead ends: 452 [2025-02-06 10:07:53,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=429, Invalid=5891, Unknown=0, NotChecked=0, Total=6320 [2025-02-06 10:07:53,225 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 153 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:53,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1576 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:07:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-06 10:07:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 361. [2025-02-06 10:07:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 358 states have (on average 1.2067039106145252) internal successors, (432), 360 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 432 transitions. [2025-02-06 10:07:53,229 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 432 transitions. Word has length 65 [2025-02-06 10:07:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:53,229 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 432 transitions. [2025-02-06 10:07:53,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 432 transitions. [2025-02-06 10:07:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 10:07:53,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:53,230 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:53,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-02-06 10:07:53,430 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,SelfDestructingSolverStorable46 [2025-02-06 10:07:53,430 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:07:53,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash -588052207, now seen corresponding path program 3 times [2025-02-06 10:07:53,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:53,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627485785] [2025-02-06 10:07:53,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:53,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:53,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 5 equivalence classes. [2025-02-06 10:07:53,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 64 of 67 statements. [2025-02-06 10:07:53,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:07:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:07:54,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:54,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627485785] [2025-02-06 10:07:54,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627485785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:54,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859492221] [2025-02-06 10:07:54,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:54,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:54,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:54,540 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-02-06 10:07:54,541 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-02-06 10:07:54,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 5 equivalence classes. [2025-02-06 10:07:54,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 64 of 67 statements. [2025-02-06 10:07:54,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:07:54,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:54,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:07:54,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:54,832 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 14 treesize of output 10 [2025-02-06 10:08:01,830 INFO L349 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2025-02-06 10:08:01,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 69 [2025-02-06 10:08:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:08:02,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:10,022 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 42 treesize of output 36 [2025-02-06 10:08:10,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:10,043 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 62 treesize of output 82 [2025-02-06 10:08:10,051 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 13 treesize of output 9 [2025-02-06 10:08:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:08:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859492221] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:10,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:10,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 69 [2025-02-06 10:08:10,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104592076] [2025-02-06 10:08:10,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:10,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-02-06 10:08:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-02-06 10:08:10,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=4533, Unknown=3, NotChecked=0, Total=4830 [2025-02-06 10:08:10,265 INFO L87 Difference]: Start difference. First operand 361 states and 432 transitions. Second operand has 70 states, 69 states have (on average 2.289855072463768) internal successors, (158), 70 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:20,932 INFO L93 Difference]: Finished difference Result 704 states and 836 transitions. [2025-02-06 10:08:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-02-06 10:08:20,933 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.289855072463768) internal successors, (158), 70 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 10:08:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:20,936 INFO L225 Difference]: With dead ends: 704 [2025-02-06 10:08:20,936 INFO L226 Difference]: Without dead ends: 704 [2025-02-06 10:08:20,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4995 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=1802, Invalid=16284, Unknown=4, NotChecked=0, Total=18090 [2025-02-06 10:08:20,942 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1609 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:20,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 1498 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 10:08:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-02-06 10:08:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 568. [2025-02-06 10:08:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 565 states have (on average 1.2318584070796461) internal successors, (696), 567 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 696 transitions. [2025-02-06 10:08:20,975 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 696 transitions. Word has length 67 [2025-02-06 10:08:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:20,975 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 696 transitions. [2025-02-06 10:08:20,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.289855072463768) internal successors, (158), 70 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 696 transitions. [2025-02-06 10:08:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 10:08:20,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:20,977 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:20,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-02-06 10:08:21,177 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,SelfDestructingSolverStorable47 [2025-02-06 10:08:21,179 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:08:21,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:21,181 INFO L85 PathProgramCache]: Analyzing trace with hash -879181654, now seen corresponding path program 1 times [2025-02-06 10:08:21,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:21,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761422464] [2025-02-06 10:08:21,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:21,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:21,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 10:08:21,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 10:08:21,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:21,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:08:22,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:22,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761422464] [2025-02-06 10:08:22,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761422464] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:22,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837175973] [2025-02-06 10:08:22,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:22,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:22,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:22,155 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-02-06 10:08:22,157 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-02-06 10:08:22,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 10:08:22,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 10:08:22,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:22,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:22,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:08:22,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:08:22,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:22,720 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 7 treesize of output 5 [2025-02-06 10:08:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:08:22,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837175973] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:22,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:22,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2025-02-06 10:08:22,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656791026] [2025-02-06 10:08:22,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:22,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:08:22,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:22,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:08:22,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:08:22,782 INFO L87 Difference]: Start difference. First operand 568 states and 696 transitions. Second operand has 28 states, 27 states have (on average 4.555555555555555) internal successors, (123), 28 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:23,594 INFO L93 Difference]: Finished difference Result 870 states and 1037 transitions. [2025-02-06 10:08:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:08:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.555555555555555) internal successors, (123), 28 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 10:08:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:23,597 INFO L225 Difference]: With dead ends: 870 [2025-02-06 10:08:23,597 INFO L226 Difference]: Without dead ends: 864 [2025-02-06 10:08:23,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 10:08:23,598 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 248 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:23,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 881 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:08:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-02-06 10:08:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 575. [2025-02-06 10:08:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 572 states have (on average 1.2377622377622377) internal successors, (708), 574 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 708 transitions. [2025-02-06 10:08:23,610 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 708 transitions. Word has length 69 [2025-02-06 10:08:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:23,611 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 708 transitions. [2025-02-06 10:08:23,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.555555555555555) internal successors, (123), 28 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 708 transitions. [2025-02-06 10:08:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 10:08:23,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:23,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:23,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:23,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-02-06 10:08:23,818 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:08:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1084531, now seen corresponding path program 2 times [2025-02-06 10:08:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652420818] [2025-02-06 10:08:23,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:23,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-06 10:08:23,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:08:23,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:23,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 10:08:24,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652420818] [2025-02-06 10:08:24,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652420818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527947212] [2025-02-06 10:08:24,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:24,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:24,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:24,190 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:24,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-02-06 10:08:24,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-06 10:08:24,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:08:24,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:24,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:24,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 10:08:24,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 10:08:24,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:24,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-06 10:08:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 10:08:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527947212] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:24,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2025-02-06 10:08:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997322770] [2025-02-06 10:08:24,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:24,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:08:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:24,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:08:24,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:08:24,914 INFO L87 Difference]: Start difference. First operand 575 states and 708 transitions. Second operand has 32 states, 31 states have (on average 4.612903225806452) internal successors, (143), 32 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:25,528 INFO L93 Difference]: Finished difference Result 593 states and 719 transitions. [2025-02-06 10:08:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:08:25,528 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.612903225806452) internal successors, (143), 32 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 10:08:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:25,530 INFO L225 Difference]: With dead ends: 593 [2025-02-06 10:08:25,530 INFO L226 Difference]: Without dead ends: 593 [2025-02-06 10:08:25,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:08:25,531 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 261 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:25,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 957 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:08:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-06 10:08:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 575. [2025-02-06 10:08:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 572 states have (on average 1.236013986013986) internal successors, (707), 574 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 707 transitions. [2025-02-06 10:08:25,541 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 707 transitions. Word has length 71 [2025-02-06 10:08:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:25,542 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 707 transitions. [2025-02-06 10:08:25,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.612903225806452) internal successors, (143), 32 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 707 transitions. [2025-02-06 10:08:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 10:08:25,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:25,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:25,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:25,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-02-06 10:08:25,757 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:08:25,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1262700889, now seen corresponding path program 3 times [2025-02-06 10:08:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:25,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463440278] [2025-02-06 10:08:25,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:25,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 5 equivalence classes. [2025-02-06 10:08:25,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 62 of 71 statements. [2025-02-06 10:08:25,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:25,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 10:08:25,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463440278] [2025-02-06 10:08:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463440278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766485589] [2025-02-06 10:08:25,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:25,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:25,965 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:25,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-02-06 10:08:26,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 5 equivalence classes. [2025-02-06 10:08:26,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 62 of 71 statements. [2025-02-06 10:08:26,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:26,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-02-06 10:08:26,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:26,537 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-02-06 10:08:26,581 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 8 treesize of output 1 [2025-02-06 10:08:28,137 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 10:08:28,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 45 [2025-02-06 10:08:28,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:28,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 10:08:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-06 10:08:28,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:30,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:30,140 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 46 treesize of output 32 [2025-02-06 10:08:30,203 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 44 treesize of output 38 [2025-02-06 10:08:30,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2025-02-06 10:08:30,494 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 15 treesize of output 11 [2025-02-06 10:08:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-06 10:08:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766485589] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:30,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:30,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 30, 31] total 68 [2025-02-06 10:08:30,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562804276] [2025-02-06 10:08:30,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:30,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-02-06 10:08:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:30,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-02-06 10:08:30,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2025-02-06 10:08:30,623 INFO L87 Difference]: Start difference. First operand 575 states and 707 transitions. Second operand has 68 states, 68 states have (on average 2.4411764705882355) internal successors, (166), 68 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:37,767 INFO L93 Difference]: Finished difference Result 883 states and 1047 transitions. [2025-02-06 10:08:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-02-06 10:08:37,767 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.4411764705882355) internal successors, (166), 68 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 10:08:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:37,769 INFO L225 Difference]: With dead ends: 883 [2025-02-06 10:08:37,769 INFO L226 Difference]: Without dead ends: 857 [2025-02-06 10:08:37,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5226 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2030, Invalid=20922, Unknown=0, NotChecked=0, Total=22952 [2025-02-06 10:08:37,771 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 523 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:37,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2298 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 10:08:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-02-06 10:08:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 779. [2025-02-06 10:08:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 776 states have (on average 1.2255154639175259) internal successors, (951), 778 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 951 transitions. [2025-02-06 10:08:37,788 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 951 transitions. Word has length 71 [2025-02-06 10:08:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 951 transitions. [2025-02-06 10:08:37,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.4411764705882355) internal successors, (166), 68 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 951 transitions. [2025-02-06 10:08:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 10:08:37,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:37,790 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:37,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:37,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-02-06 10:08:37,995 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:08:37,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1387033099, now seen corresponding path program 3 times [2025-02-06 10:08:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:37,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29026899] [2025-02-06 10:08:37,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:37,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:38,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 5 equivalence classes. [2025-02-06 10:08:38,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 64 of 76 statements. [2025-02-06 10:08:38,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:38,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-06 10:08:38,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29026899] [2025-02-06 10:08:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29026899] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304415862] [2025-02-06 10:08:38,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:38,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:38,526 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:38,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-02-06 10:08:38,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 5 equivalence classes. [2025-02-06 10:08:38,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 64 of 76 statements. [2025-02-06 10:08:38,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:38,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:38,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-02-06 10:08:38,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:38,896 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-02-06 10:08:39,950 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2025-02-06 10:08:39,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 39 [2025-02-06 10:08:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 10:08:40,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:41,135 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 59 treesize of output 51 [2025-02-06 10:08:41,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-02-06 10:08:41,421 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-02-06 10:08:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 10:08:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304415862] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:41,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 25] total 64 [2025-02-06 10:08:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049989792] [2025-02-06 10:08:41,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-06 10:08:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:41,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-06 10:08:41,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=3852, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 10:08:41,558 INFO L87 Difference]: Start difference. First operand 779 states and 951 transitions. Second operand has 65 states, 64 states have (on average 2.53125) internal successors, (162), 65 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:45,727 INFO L93 Difference]: Finished difference Result 937 states and 1106 transitions. [2025-02-06 10:08:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-02-06 10:08:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.53125) internal successors, (162), 65 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-06 10:08:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:45,729 INFO L225 Difference]: With dead ends: 937 [2025-02-06 10:08:45,729 INFO L226 Difference]: Without dead ends: 937 [2025-02-06 10:08:45,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4012 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1894, Invalid=14876, Unknown=0, NotChecked=0, Total=16770 [2025-02-06 10:08:45,731 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1658 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:45,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 2274 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 10:08:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-06 10:08:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 795. [2025-02-06 10:08:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 792 states have (on average 1.220959595959596) internal successors, (967), 794 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 967 transitions. [2025-02-06 10:08:45,740 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 967 transitions. Word has length 76 [2025-02-06 10:08:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:45,741 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 967 transitions. [2025-02-06 10:08:45,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.53125) internal successors, (162), 65 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 967 transitions. [2025-02-06 10:08:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 10:08:45,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:45,742 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:45,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-02-06 10:08:45,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,32 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:45,942 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-02-06 10:08:45,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash 459580705, now seen corresponding path program 4 times [2025-02-06 10:08:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:45,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456674161] [2025-02-06 10:08:45,943 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:45,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-02-06 10:08:45,972 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 72 of 82 statements. [2025-02-06 10:08:45,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:45,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat