./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-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 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:13:22,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:13:22,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:13:22,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:13:22,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:13:22,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:13:22,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:13:22,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:13:22,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:13:22,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:13:22,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:13:22,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:13:22,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:13:22,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:13:22,244 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:13:22,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:13:22,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:13:22,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:13:22,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:13:22,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:13:22,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:13:22,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:13:22,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:13:22,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:13:22,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:13:22,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:13:22,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:13:22,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:13:22,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:13:22,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:13:22,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:13:22,247 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 -> 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 [2025-02-08 06:13:22,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:13:22,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:13:22,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:13:22,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:13:22,481 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:13:22,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2025-02-08 06:13:23,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ba0f5a8a/5cb8ef6281574038b38a6211aa173b4b/FLAG0424d55fa [2025-02-08 06:13:24,052 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:13:24,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2025-02-08 06:13:24,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ba0f5a8a/5cb8ef6281574038b38a6211aa173b4b/FLAG0424d55fa [2025-02-08 06:13:24,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ba0f5a8a/5cb8ef6281574038b38a6211aa173b4b [2025-02-08 06:13:24,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:13:24,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:13:24,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:13:24,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:13:24,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:13:24,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275adb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24, skipping insertion in model container [2025-02-08 06:13:24,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:13:24,579 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-08 06:13:24,580 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-08 06:13:24,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:13:24,591 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:13:24,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:13:24,633 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:13:24,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24 WrapperNode [2025-02-08 06:13:24,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:13:24,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:13:24,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:13:24,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:13:24,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,674 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-02-08 06:13:24,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:13:24,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:13:24,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:13:24,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:13:24,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,687 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [1, 3]. 75 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2]. [2025-02-08 06:13:24,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:13:24,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:13:24,699 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:13:24,699 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:13:24,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (1/1) ... [2025-02-08 06:13:24,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:13:24,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:24,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:13:24,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:13:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:13:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:13:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:13:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:13:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:13:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:13:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:13:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:13:24,835 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:13:24,836 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:13:24,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; [2025-02-08 06:13:24,966 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-08 06:13:24,966 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:13:24,972 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:13:24,972 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:13:24,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:13:24 BoogieIcfgContainer [2025-02-08 06:13:24,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:13:24,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:13:24,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:13:24,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:13:24,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:13:24" (1/3) ... [2025-02-08 06:13:24,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8a5e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:13:24, skipping insertion in model container [2025-02-08 06:13:24,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:13:24" (2/3) ... [2025-02-08 06:13:24,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8a5e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:13:24, skipping insertion in model container [2025-02-08 06:13:24,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:13:24" (3/3) ... [2025-02-08 06:13:24,982 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-2.i [2025-02-08 06:13:24,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:13:24,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrcpy-alloca-2.i that has 1 procedures, 26 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-02-08 06:13:25,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:13:25,027 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;@636e5fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:13:25,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 06:13:25,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.9375) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:13:25,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:25,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:13:25,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:25,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash 62920453, now seen corresponding path program 1 times [2025-02-08 06:13:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:25,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779889259] [2025-02-08 06:13:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:25,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:25,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:13:25,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:13:25,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:25,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779889259] [2025-02-08 06:13:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779889259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:25,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:13:25,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282862298] [2025-02-08 06:13:25,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:25,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:13:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:25,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:13:25,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:25,226 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.9375) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:25,273 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-02-08 06:13:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:13:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:13:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:25,281 INFO L225 Difference]: With dead ends: 27 [2025-02-08 06:13:25,282 INFO L226 Difference]: Without dead ends: 25 [2025-02-08 06:13:25,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:13:25,286 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:25,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-08 06:13:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-08 06:13:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.8125) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-08 06:13:25,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 5 [2025-02-08 06:13:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:25,312 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-08 06:13:25,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-08 06:13:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:13:25,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:25,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:13:25,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:13:25,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:25,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash 62921414, now seen corresponding path program 1 times [2025-02-08 06:13:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:25,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523141413] [2025-02-08 06:13:25,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:25,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:13:25,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:13:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:25,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:25,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523141413] [2025-02-08 06:13:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523141413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:25,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:25,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:13:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442951975] [2025-02-08 06:13:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:25,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:13:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:25,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:13:25,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:13:25,338 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:25,352 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-02-08 06:13:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:13:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:13:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:25,353 INFO L225 Difference]: With dead ends: 26 [2025-02-08 06:13:25,353 INFO L226 Difference]: Without dead ends: 25 [2025-02-08 06:13:25,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:13:25,361 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:25,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-08 06:13:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-02-08 06:13:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.8) internal successors, (27), 23 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-08 06:13:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-08 06:13:25,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 5 [2025-02-08 06:13:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:25,365 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-08 06:13:25,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-02-08 06:13:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:13:25,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:25,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:13:25,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:13:25,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1950536604, now seen corresponding path program 1 times [2025-02-08 06:13:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284996665] [2025-02-08 06:13:25,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:25,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:13:25,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:13:25,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:25,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284996665] [2025-02-08 06:13:25,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284996665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:25,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:25,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:13:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513562473] [2025-02-08 06:13:25,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:25,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:13:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:25,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:13:25,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:13:25,435 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:25,455 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-02-08 06:13:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:13:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-08 06:13:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:25,456 INFO L225 Difference]: With dead ends: 22 [2025-02-08 06:13:25,456 INFO L226 Difference]: Without dead ends: 22 [2025-02-08 06:13:25,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:13:25,457 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:25,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-08 06:13:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-08 06:13:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-08 06:13:25,459 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2025-02-08 06:13:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-08 06:13:25,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-02-08 06:13:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:13:25,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:25,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:13:25,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:13:25,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:25,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1950536605, now seen corresponding path program 1 times [2025-02-08 06:13:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:25,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963013223] [2025-02-08 06:13:25,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:25,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:13:25,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:13:25,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:25,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:25,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963013223] [2025-02-08 06:13:25,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963013223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:25,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:13:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532740296] [2025-02-08 06:13:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:13:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:25,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:13:25,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:25,617 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:25,636 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-02-08 06:13:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:13:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-08 06:13:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:25,637 INFO L225 Difference]: With dead ends: 28 [2025-02-08 06:13:25,637 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 06:13:25,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-08 06:13:25,638 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:25,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 36 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 06:13:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-02-08 06:13:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.6) internal successors, (32), 26 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-08 06:13:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-02-08 06:13:25,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 6 [2025-02-08 06:13:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:25,640 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-02-08 06:13:25,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-02-08 06:13:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:13:25,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:25,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:13:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:13:25,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:25,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:25,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1950536765, now seen corresponding path program 1 times [2025-02-08 06:13:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724223867] [2025-02-08 06:13:25,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:25,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:13:25,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:13:25,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:25,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:25,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:25,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724223867] [2025-02-08 06:13:25,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724223867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:25,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:25,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:13:25,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007821389] [2025-02-08 06:13:25,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:25,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:13:25,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:25,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:13:25,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:25,687 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:25,703 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-02-08 06:13:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:13:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-08 06:13:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:25,704 INFO L225 Difference]: With dead ends: 25 [2025-02-08 06:13:25,704 INFO L226 Difference]: Without dead ends: 25 [2025-02-08 06:13:25,704 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-08 06:13:25,705 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:25,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-08 06:13:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-08 06:13:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 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-08 06:13:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-02-08 06:13:25,710 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2025-02-08 06:13:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:25,710 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-02-08 06:13:25,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-02-08 06:13:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:13:25,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:25,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:13:25,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:13:25,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:25,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:25,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1950566396, now seen corresponding path program 1 times [2025-02-08 06:13:25,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:25,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697420036] [2025-02-08 06:13:25,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:25,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:25,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:13:25,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:13:25,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:25,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:25,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:25,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697420036] [2025-02-08 06:13:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697420036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:25,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:13:25,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234122433] [2025-02-08 06:13:25,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:25,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:13:25,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:25,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:13:25,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:13:25,837 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:25,856 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-02-08 06:13:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:13:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-08 06:13:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:25,858 INFO L225 Difference]: With dead ends: 24 [2025-02-08 06:13:25,858 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 06:13:25,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:13:25,859 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:25,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 06:13:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-02-08 06:13:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-02-08 06:13:25,861 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2025-02-08 06:13:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:25,861 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-02-08 06:13:25,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-02-08 06:13:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:13:25,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:25,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:13:25,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:13:25,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1950566556, now seen corresponding path program 1 times [2025-02-08 06:13:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153974889] [2025-02-08 06:13:25,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:25,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:13:25,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:13:25,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:25,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:25,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:25,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153974889] [2025-02-08 06:13:25,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153974889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:25,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:25,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:13:25,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747237504] [2025-02-08 06:13:25,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:25,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:13:25,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:25,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:13:25,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:25,931 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:25,956 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-02-08 06:13:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:13:25,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-08 06:13:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:25,958 INFO L225 Difference]: With dead ends: 28 [2025-02-08 06:13:25,958 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 06:13:25,958 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-08 06:13:25,958 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:25,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 06:13:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-02-08 06:13:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 23 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-08 06:13:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-08 06:13:25,960 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2025-02-08 06:13:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:25,961 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-08 06:13:25,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-08 06:13:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:13:25,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:25,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:13:25,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:13:25,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:25,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1951490077, now seen corresponding path program 1 times [2025-02-08 06:13:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381855793] [2025-02-08 06:13:25,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:25,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:13:25,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:13:25,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:25,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:26,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:26,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381855793] [2025-02-08 06:13:26,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381855793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:26,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:26,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:13:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624282340] [2025-02-08 06:13:26,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:26,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:13:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:26,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:13:26,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:13:26,108 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:26,161 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-02-08 06:13:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:13:26,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-08 06:13:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:26,162 INFO L225 Difference]: With dead ends: 27 [2025-02-08 06:13:26,162 INFO L226 Difference]: Without dead ends: 27 [2025-02-08 06:13:26,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:13:26,163 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:26,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-08 06:13:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-08 06:13:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.55) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-02-08 06:13:26,166 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2025-02-08 06:13:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:26,166 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-02-08 06:13:26,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-02-08 06:13:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:13:26,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:26,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:13:26,167 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:26,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1823409204, now seen corresponding path program 1 times [2025-02-08 06:13:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:26,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191459105] [2025-02-08 06:13:26,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:26,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:13:26,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:13:26,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:26,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191459105] [2025-02-08 06:13:26,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191459105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:26,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:13:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953315625] [2025-02-08 06:13:26,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:26,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:13:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:26,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:13:26,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:26,267 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:26,290 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-02-08 06:13:26,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:13:26,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-02-08 06:13:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:26,290 INFO L225 Difference]: With dead ends: 25 [2025-02-08 06:13:26,291 INFO L226 Difference]: Without dead ends: 25 [2025-02-08 06:13:26,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:26,291 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:26,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-08 06:13:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-08 06:13:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 24 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-08 06:13:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-02-08 06:13:26,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 9 [2025-02-08 06:13:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:26,295 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-02-08 06:13:26,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-02-08 06:13:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:13:26,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:26,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:26,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:13:26,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:26,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:26,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1823409205, now seen corresponding path program 1 times [2025-02-08 06:13:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:26,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377271068] [2025-02-08 06:13:26,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:26,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:13:26,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:13:26,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:26,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:26,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:26,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377271068] [2025-02-08 06:13:26,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377271068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:26,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:26,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:13:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979765996] [2025-02-08 06:13:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:26,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:13:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:26,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:13:26,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:13:26,441 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:26,488 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-02-08 06:13:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:13:26,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-02-08 06:13:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:26,489 INFO L225 Difference]: With dead ends: 33 [2025-02-08 06:13:26,489 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 06:13:26,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:13:26,490 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:26,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 47 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 06:13:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2025-02-08 06:13:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 26 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-08 06:13:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-02-08 06:13:26,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2025-02-08 06:13:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:26,492 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-02-08 06:13:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-02-08 06:13:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:13:26,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:26,492 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:26,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:13:26,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:26,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash 163527642, now seen corresponding path program 1 times [2025-02-08 06:13:26,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:26,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947376527] [2025-02-08 06:13:26,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:26,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:13:26,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:13:26,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:26,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:26,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:26,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947376527] [2025-02-08 06:13:26,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947376527] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:26,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18337350] [2025-02-08 06:13:26,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:26,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:26,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:26,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:13:26,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:13:26,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:13:26,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:26,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:26,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 06:13:26,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:26,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-08 06:13:26,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-08 06:13:26,893 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-08 06:13:26,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18337350] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:27,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:27,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 06:13:27,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425398165] [2025-02-08 06:13:27,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:27,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:13:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:27,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:13:27,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:13:27,016 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-08 06:13:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:27,167 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-02-08 06:13:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:13:27,167 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 9 [2025-02-08 06:13:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:27,167 INFO L225 Difference]: With dead ends: 28 [2025-02-08 06:13:27,167 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 06:13:27,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:13:27,168 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:27,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:13:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 06:13:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-02-08 06:13:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.4) internal successors, (28), 23 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-08 06:13:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-08 06:13:27,169 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2025-02-08 06:13:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:27,169 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-08 06:13:27,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-08 06:13:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-08 06:13:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:13:27,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:27,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:27,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:13:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:13:27,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash 691110455, now seen corresponding path program 1 times [2025-02-08 06:13:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:27,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066134493] [2025-02-08 06:13:27,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:27,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:13:27,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:13:27,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:27,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:27,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066134493] [2025-02-08 06:13:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066134493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:27,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:13:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223622104] [2025-02-08 06:13:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:13:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:27,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:13:27,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:27,426 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:27,452 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-02-08 06:13:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:13:27,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:13:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:27,452 INFO L225 Difference]: With dead ends: 23 [2025-02-08 06:13:27,452 INFO L226 Difference]: Without dead ends: 23 [2025-02-08 06:13:27,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:27,453 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:27,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-08 06:13:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-08 06:13:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.35) internal successors, (27), 22 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-08 06:13:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-02-08 06:13:27,458 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2025-02-08 06:13:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:27,458 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-02-08 06:13:27,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-02-08 06:13:27,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:13:27,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:27,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:27,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:13:27,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:27,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 691110456, now seen corresponding path program 1 times [2025-02-08 06:13:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:27,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376336406] [2025-02-08 06:13:27,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:27,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:13:27,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:13:27,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:27,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376336406] [2025-02-08 06:13:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376336406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:13:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260333154] [2025-02-08 06:13:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:27,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:13:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:27,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:13:27,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:13:27,582 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-08 06:13:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:27,604 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-02-08 06:13:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:13:27,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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-08 06:13:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:27,605 INFO L225 Difference]: With dead ends: 32 [2025-02-08 06:13:27,605 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 06:13:27,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:13:27,605 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 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-08 06:13:27,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 06:13:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-02-08 06:13:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 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-08 06:13:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-02-08 06:13:27,607 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 10 [2025-02-08 06:13:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:27,607 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-02-08 06:13:27,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-08 06:13:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-02-08 06:13:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:13:27,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:27,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:27,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:13:27,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:27,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1116344007, now seen corresponding path program 1 times [2025-02-08 06:13:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:27,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442420421] [2025-02-08 06:13:27,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:27,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:13:27,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:13:27,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:27,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442420421] [2025-02-08 06:13:27,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442420421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:27,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:27,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:13:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484004172] [2025-02-08 06:13:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:27,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:13:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:27,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:13:27,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:13:27,723 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 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-08 06:13:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:27,757 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-02-08 06:13:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:13:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 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-08 06:13:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:27,757 INFO L225 Difference]: With dead ends: 33 [2025-02-08 06:13:27,757 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 06:13:27,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:13:27,758 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:27,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 06:13:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2025-02-08 06:13:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 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-08 06:13:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-08 06:13:27,760 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 10 [2025-02-08 06:13:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:27,761 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-08 06:13:27,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-08 06:13:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-08 06:13:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:13:27,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:27,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:27,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:13:27,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:27,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1201675058, now seen corresponding path program 1 times [2025-02-08 06:13:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:27,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193062615] [2025-02-08 06:13:27,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:27,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:27,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:13:27,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:13:27,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:27,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:27,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193062615] [2025-02-08 06:13:27,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193062615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:27,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:27,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:13:27,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3382971] [2025-02-08 06:13:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:27,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:13:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:27,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:13:27,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:27,864 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:27,877 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-02-08 06:13:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:13:27,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-08 06:13:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:27,878 INFO L225 Difference]: With dead ends: 23 [2025-02-08 06:13:27,878 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 06:13:27,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:13:27,878 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:27,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 06:13:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 06:13:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-02-08 06:13:27,879 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2025-02-08 06:13:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:27,879 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-08 06:13:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-02-08 06:13:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:13:27,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:27,880 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:27,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:13:27,880 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1201673743, now seen corresponding path program 1 times [2025-02-08 06:13:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:27,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38189665] [2025-02-08 06:13:27,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:27,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:27,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:13:27,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:13:27,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:27,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:28,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38189665] [2025-02-08 06:13:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38189665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:28,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:28,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:13:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519880246] [2025-02-08 06:13:28,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:13:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:13:28,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:13:28,019 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:28,056 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-02-08 06:13:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:13:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-08 06:13:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:28,057 INFO L225 Difference]: With dead ends: 29 [2025-02-08 06:13:28,057 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 06:13:28,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:13:28,057 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:28,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 06:13:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 06:13:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-02-08 06:13:28,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2025-02-08 06:13:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:28,059 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-02-08 06:13:28,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-02-08 06:13:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:13:28,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:28,060 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:28,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:13:28,060 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:28,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1296342194, now seen corresponding path program 1 times [2025-02-08 06:13:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:28,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768959136] [2025-02-08 06:13:28,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:28,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:13:28,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:13:28,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:28,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:28,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:28,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768959136] [2025-02-08 06:13:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768959136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:28,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:13:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411701290] [2025-02-08 06:13:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:28,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:13:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:28,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:13:28,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:13:28,189 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:28,223 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-02-08 06:13:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:13:28,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-08 06:13:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:28,223 INFO L225 Difference]: With dead ends: 27 [2025-02-08 06:13:28,223 INFO L226 Difference]: Without dead ends: 18 [2025-02-08 06:13:28,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:13:28,224 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:28,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-08 06:13:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-08 06:13:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-02-08 06:13:28,225 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2025-02-08 06:13:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:28,226 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-02-08 06:13:28,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-02-08 06:13:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:13:28,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:28,226 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:28,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:13:28,226 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:28,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1425424913, now seen corresponding path program 1 times [2025-02-08 06:13:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685202301] [2025-02-08 06:13:28,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:28,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:13:28,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:13:28,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:28,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685202301] [2025-02-08 06:13:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685202301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:13:28,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:13:28,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:13:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687791575] [2025-02-08 06:13:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:13:28,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:13:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:28,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:13:28,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:13:28,354 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:28,394 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-02-08 06:13:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:13:28,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-08 06:13:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:28,394 INFO L225 Difference]: With dead ends: 27 [2025-02-08 06:13:28,394 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 06:13:28,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:13:28,395 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:28,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 30 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:13:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 06:13:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-02-08 06:13:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-08 06:13:28,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2025-02-08 06:13:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:28,396 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-08 06:13:28,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-08 06:13:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:13:28,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:28,397 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:28,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:13:28,397 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:28,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1920325708, now seen corresponding path program 1 times [2025-02-08 06:13:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653372040] [2025-02-08 06:13:28,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:28,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:13:28,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:13:28,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:28,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:28,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653372040] [2025-02-08 06:13:28,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653372040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:28,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035944512] [2025-02-08 06:13:28,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:28,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:28,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:28,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:28,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:13:28,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:13:28,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:13:28,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:28,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:28,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:13:28,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:28,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:28,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:13:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:28,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035944512] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:28,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:28,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-08 06:13:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993054242] [2025-02-08 06:13:28,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:28,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 06:13:28,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:28,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 06:13:28,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:13:28,840 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:28,932 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-02-08 06:13:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:13:28,932 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 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 16 [2025-02-08 06:13:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:28,933 INFO L225 Difference]: With dead ends: 27 [2025-02-08 06:13:28,933 INFO L226 Difference]: Without dead ends: 27 [2025-02-08 06:13:28,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:13:28,933 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:28,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:13:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-08 06:13:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-02-08 06:13:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-02-08 06:13:28,935 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2025-02-08 06:13:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:28,935 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-02-08 06:13:28,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-02-08 06:13:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:13:28,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:28,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:28,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:13:29,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:29,136 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:29,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash 599445145, now seen corresponding path program 1 times [2025-02-08 06:13:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752038965] [2025-02-08 06:13:29,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:29,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:13:29,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:13:29,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:29,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:29,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752038965] [2025-02-08 06:13:29,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752038965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:29,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975156725] [2025-02-08 06:13:29,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:13:29,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:29,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:29,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:29,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:13:29,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:13:29,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:13:29,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:29,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:29,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 06:13:29,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:29,432 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 1 [2025-02-08 06:13:29,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:13:29,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:13:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:29,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:29,848 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:13:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975156725] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:29,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2025-02-08 06:13:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093747517] [2025-02-08 06:13:29,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:29,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:13:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:29,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:13:29,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:13:29,872 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:29,988 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-02-08 06:13:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:13:29,988 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 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-08 06:13:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:29,989 INFO L225 Difference]: With dead ends: 29 [2025-02-08 06:13:29,989 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 06:13:29,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:13:29,989 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:29,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 45 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:13:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 06:13:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-02-08 06:13:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-02-08 06:13:29,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2025-02-08 06:13:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:29,991 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-02-08 06:13:29,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-02-08 06:13:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:13:29,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:29,991 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:29,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:13:30,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:30,192 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:30,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:30,193 INFO L85 PathProgramCache]: Analyzing trace with hash -403753488, now seen corresponding path program 2 times [2025-02-08 06:13:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:30,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508920531] [2025-02-08 06:13:30,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:30,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 06:13:30,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:13:30,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:30,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508920531] [2025-02-08 06:13:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508920531] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525345941] [2025-02-08 06:13:30,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:30,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:30,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:30,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:30,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:13:30,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 06:13:30,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:13:30,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:30,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:30,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:13:30,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:30,567 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-08 06:13:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:30,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:30,644 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-08 06:13:30,646 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-08 06:13:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525345941] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:30,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:30,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2025-02-08 06:13:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395546814] [2025-02-08 06:13:30,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:30,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:13:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:30,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:13:30,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:13:30,688 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 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-08 06:13:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:30,866 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2025-02-08 06:13:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:13:30,867 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 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 20 [2025-02-08 06:13:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:30,867 INFO L225 Difference]: With dead ends: 38 [2025-02-08 06:13:30,867 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 06:13:30,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:13:30,868 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:30,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 92 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:13:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 06:13:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-08 06:13:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.125) internal successors, (27), 25 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-08 06:13:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-02-08 06:13:30,870 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2025-02-08 06:13:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:30,870 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-02-08 06:13:30,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 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-08 06:13:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-02-08 06:13:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:13:30,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:30,870 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:30,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:13:31,075 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,SelfDestructingSolverStorable20 [2025-02-08 06:13:31,076 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:31,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:31,076 INFO L85 PathProgramCache]: Analyzing trace with hash 92226285, now seen corresponding path program 3 times [2025-02-08 06:13:31,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:31,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648730800] [2025-02-08 06:13:31,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:31,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:31,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-02-08 06:13:31,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:13:31,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:13:31,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648730800] [2025-02-08 06:13:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648730800] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790465448] [2025-02-08 06:13:31,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:31,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:31,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:31,255 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:31,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:13:31,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-02-08 06:13:31,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:13:31,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:13:31,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:31,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 06:13:31,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:31,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:31,484 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-08 06:13:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:31,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790465448] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:31,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:31,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-02-08 06:13:31,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083532926] [2025-02-08 06:13:31,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:31,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:13:31,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:31,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:13:31,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:13:31,515 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:31,612 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2025-02-08 06:13:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:13:31,613 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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 23 [2025-02-08 06:13:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:31,614 INFO L225 Difference]: With dead ends: 32 [2025-02-08 06:13:31,614 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 06:13:31,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:13:31,615 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:31,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 45 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:13:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 06:13:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-02-08 06:13:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 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-08 06:13:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-02-08 06:13:31,618 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2025-02-08 06:13:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:31,618 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-02-08 06:13:31,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-02-08 06:13:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:13:31,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:31,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:31,630 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-08 06:13:31,825 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,SelfDestructingSolverStorable21 [2025-02-08 06:13:31,825 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:31,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1435952512, now seen corresponding path program 2 times [2025-02-08 06:13:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36308480] [2025-02-08 06:13:31,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:31,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 06:13:31,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:13:31,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:31,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:32,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36308480] [2025-02-08 06:13:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36308480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165126419] [2025-02-08 06:13:32,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:32,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:32,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:32,033 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:32,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:13:32,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 06:13:32,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:13:32,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:32,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:32,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:13:32,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:32,130 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 1 [2025-02-08 06:13:32,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:13:32,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:13:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:32,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:32,900 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:13:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165126419] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:32,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:32,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2025-02-08 06:13:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466655750] [2025-02-08 06:13:32,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:32,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:13:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:32,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:13:32,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:13:32,931 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:33,136 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-02-08 06:13:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:13:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-08 06:13:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:33,137 INFO L225 Difference]: With dead ends: 36 [2025-02-08 06:13:33,137 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 06:13:33,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:13:33,138 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:33,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 53 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:13:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 06:13:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2025-02-08 06:13:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-08 06:13:33,139 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2025-02-08 06:13:33,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:33,139 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-08 06:13:33,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-08 06:13:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:13:33,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:33,140 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:33,146 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-08 06:13:33,344 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,SelfDestructingSolverStorable22 [2025-02-08 06:13:33,344 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:33,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:33,345 INFO L85 PathProgramCache]: Analyzing trace with hash -587068247, now seen corresponding path program 4 times [2025-02-08 06:13:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470927455] [2025-02-08 06:13:33,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:13:33,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:33,355 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-08 06:13:33,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-02-08 06:13:33,376 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:13:33,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:13:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470927455] [2025-02-08 06:13:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470927455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578464365] [2025-02-08 06:13:33,818 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:13:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:33,820 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:33,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:13:33,861 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-08 06:13:33,877 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-02-08 06:13:33,877 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:13:33,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:33,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 06:13:33,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:33,905 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-08 06:13:34,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:13:34,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 121 [2025-02-08 06:13:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:13:34,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:35,100 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-08 06:13:35,106 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 68 treesize of output 58 [2025-02-08 06:13:35,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:13:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:13:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578464365] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:35,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-02-08 06:13:35,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007833281] [2025-02-08 06:13:35,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:35,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 06:13:35,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:35,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 06:13:35,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:13:35,142 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:35,422 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-02-08 06:13:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:13:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 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-08 06:13:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:35,423 INFO L225 Difference]: With dead ends: 30 [2025-02-08 06:13:35,423 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 06:13:35,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:13:35,424 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:35,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:13:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 06:13:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-02-08 06:13:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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-08 06:13:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-02-08 06:13:35,429 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2025-02-08 06:13:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:35,429 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-02-08 06:13:35,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-02-08 06:13:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:13:35,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:35,430 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:35,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:13:35,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:35,631 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:35,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1019246524, now seen corresponding path program 3 times [2025-02-08 06:13:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:35,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267301471] [2025-02-08 06:13:35,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:35,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-02-08 06:13:35,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:13:35,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 06:13:35,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:35,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:35,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267301471] [2025-02-08 06:13:35,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267301471] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:35,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581272298] [2025-02-08 06:13:35,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:35,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:35,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:35,839 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:35,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:13:35,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-02-08 06:13:35,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:13:35,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 06:13:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:35,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 06:13:35,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:35,957 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-08 06:13:36,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:13:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:36,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:36,032 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-08 06:13:36,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:13:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581272298] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:36,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-02-08 06:13:36,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887204056] [2025-02-08 06:13:36,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:36,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:13:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:36,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:13:36,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:13:36,074 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:36,331 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2025-02-08 06:13:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:13:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-08 06:13:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:36,332 INFO L225 Difference]: With dead ends: 48 [2025-02-08 06:13:36,332 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 06:13:36,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 06:13:36,336 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:36,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:13:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 06:13:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-02-08 06:13:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-02-08 06:13:36,337 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2025-02-08 06:13:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:36,337 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-02-08 06:13:36,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-02-08 06:13:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:13:36,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:36,337 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:36,350 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-08 06:13:36,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:36,538 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:36,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash 228935745, now seen corresponding path program 4 times [2025-02-08 06:13:36,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:36,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611096510] [2025-02-08 06:13:36,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:13:36,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:36,547 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-08 06:13:36,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:13:36,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 06:13:36,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:36,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611096510] [2025-02-08 06:13:36,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611096510] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785001978] [2025-02-08 06:13:36,955 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:13:36,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:36,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:36,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:36,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:13:37,023 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-08 06:13:37,047 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:13:37,047 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 06:13:37,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:37,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 06:13:37,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:37,094 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 1 [2025-02-08 06:13:37,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:13:37,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:13:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:37,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:37,859 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:13:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785001978] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:37,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:37,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 30 [2025-02-08 06:13:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385378274] [2025-02-08 06:13:37,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:37,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 06:13:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:37,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 06:13:37,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:13:37,889 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 32 states, 31 states have (on average 3.0) internal successors, (93), 31 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-08 06:13:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:38,087 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-02-08 06:13:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:13:38,088 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 31 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) Word has length 31 [2025-02-08 06:13:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:38,088 INFO L225 Difference]: With dead ends: 37 [2025-02-08 06:13:38,088 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 06:13:38,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 06:13:38,089 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:38,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 74 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:13:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 06:13:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-02-08 06:13:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-02-08 06:13:38,090 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 31 [2025-02-08 06:13:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:38,091 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-02-08 06:13:38,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 31 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-08 06:13:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-02-08 06:13:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:13:38,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:38,091 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:38,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:13:38,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:38,296 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:38,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1388515963, now seen corresponding path program 5 times [2025-02-08 06:13:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:38,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894487923] [2025-02-08 06:13:38,297 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:13:38,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:38,310 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 5 equivalence classes. [2025-02-08 06:13:38,318 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:13:38,319 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 06:13:38,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:38,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:38,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894487923] [2025-02-08 06:13:38,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894487923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:38,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055855962] [2025-02-08 06:13:38,607 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:13:38,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:38,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:38,609 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:38,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:13:38,658 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 5 equivalence classes. [2025-02-08 06:13:38,689 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:13:38,689 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 06:13:38,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:38,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 06:13:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:38,781 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-08 06:13:38,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:13:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:38,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:38,921 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-08 06:13:38,922 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-08 06:13:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055855962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:38,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 29 [2025-02-08 06:13:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561113089] [2025-02-08 06:13:38,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:38,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:13:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:38,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:13:38,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:13:38,980 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:39,415 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2025-02-08 06:13:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:13:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 06:13:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:39,416 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:13:39,416 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 06:13:39,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=1711, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:13:39,417 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:39,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 147 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:13:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 06:13:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-02-08 06:13:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 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-08 06:13:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2025-02-08 06:13:39,419 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2025-02-08 06:13:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:39,419 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2025-02-08 06:13:39,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2025-02-08 06:13:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:13:39,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:39,419 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:39,426 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-08 06:13:39,620 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,SelfDestructingSolverStorable26 [2025-02-08 06:13:39,621 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:39,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2126797080, now seen corresponding path program 6 times [2025-02-08 06:13:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:39,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567903454] [2025-02-08 06:13:39,622 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:13:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:39,628 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 5 equivalence classes. [2025-02-08 06:13:39,638 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:13:39,639 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 06:13:39,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:39,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:39,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567903454] [2025-02-08 06:13:39,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567903454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:39,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114351216] [2025-02-08 06:13:39,924 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:13:39,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:39,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:39,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:13:39,980 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 5 equivalence classes. [2025-02-08 06:13:40,108 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:13:40,108 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 06:13:40,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:40,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:13:40,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:40,139 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 1 [2025-02-08 06:13:40,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:13:40,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:13:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:40,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:40,736 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:13:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:40,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114351216] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:40,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:40,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2025-02-08 06:13:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107833548] [2025-02-08 06:13:40,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:40,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 06:13:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:40,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 06:13:40,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 06:13:40,765 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 39 states, 38 states have (on average 3.0) internal successors, (114), 38 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:41,059 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2025-02-08 06:13:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:13:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.0) internal successors, (114), 38 states have internal predecessors, (114), 0 states have call successors, (0), 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-08 06:13:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:41,060 INFO L225 Difference]: With dead ends: 44 [2025-02-08 06:13:41,060 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 06:13:41,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:13:41,061 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:41,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:13:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 06:13:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-02-08 06:13:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2025-02-08 06:13:41,063 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2025-02-08 06:13:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:41,063 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2025-02-08 06:13:41,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.0) internal successors, (114), 38 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2025-02-08 06:13:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 06:13:41,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:41,063 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:41,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:13:41,264 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,SelfDestructingSolverStorable27 [2025-02-08 06:13:41,264 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:41,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1683644244, now seen corresponding path program 7 times [2025-02-08 06:13:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730640103] [2025-02-08 06:13:41,265 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:13:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:41,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:13:41,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:13:41,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:41,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 37 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730640103] [2025-02-08 06:13:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730640103] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733857954] [2025-02-08 06:13:41,597 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:13:41,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:41,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:41,601 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:41,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:13:41,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:13:41,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:13:41,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:41,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:41,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 06:13:41,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:41,829 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-08 06:13:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:42,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:42,034 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-08 06:13:42,036 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-08 06:13:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733857954] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:42,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2025-02-08 06:13:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876161556] [2025-02-08 06:13:42,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:42,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 06:13:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:42,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 06:13:42,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:13:42,115 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:42,599 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2025-02-08 06:13:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:13:42,600 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 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-08 06:13:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:42,600 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:13:42,600 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 06:13:42,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=2060, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:13:42,601 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:42,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 186 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:13:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 06:13:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-02-08 06:13:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2025-02-08 06:13:42,602 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 42 [2025-02-08 06:13:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:42,602 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2025-02-08 06:13:42,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2025-02-08 06:13:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:13:42,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:42,603 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:42,610 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-08 06:13:42,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:13:42,808 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:42,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash -748084759, now seen corresponding path program 8 times [2025-02-08 06:13:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655434293] [2025-02-08 06:13:42,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:42,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 06:13:42,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:13:42,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655434293] [2025-02-08 06:13:43,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655434293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:43,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969440447] [2025-02-08 06:13:43,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:43,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:43,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:43,271 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-08 06:13:43,275 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-08 06:13:43,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 06:13:43,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:13:43,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:43,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:43,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-08 06:13:43,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:43,401 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 1 [2025-02-08 06:13:43,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:13:43,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:13:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:43,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:44,236 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:13:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969440447] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:44,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:44,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2025-02-08 06:13:44,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835086513] [2025-02-08 06:13:44,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:44,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:13:44,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:44,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:13:44,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1543, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 06:13:44,319 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 42 states, 41 states have (on average 3.292682926829268) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:44,868 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2025-02-08 06:13:44,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:13:44,868 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.292682926829268) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 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 45 [2025-02-08 06:13:44,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:44,869 INFO L225 Difference]: With dead ends: 51 [2025-02-08 06:13:44,869 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:13:44,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:13:44,870 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:44,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 170 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:13:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:13:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-02-08 06:13:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2025-02-08 06:13:44,872 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2025-02-08 06:13:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:44,873 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-02-08 06:13:44,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.292682926829268) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2025-02-08 06:13:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:13:44,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:44,874 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:44,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 06:13:45,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:45,074 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:45,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash -726944979, now seen corresponding path program 9 times [2025-02-08 06:13:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:45,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865788424] [2025-02-08 06:13:45,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:45,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:45,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 7 equivalence classes. [2025-02-08 06:13:45,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:13:45,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 06:13:45,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 56 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865788424] [2025-02-08 06:13:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865788424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455844737] [2025-02-08 06:13:45,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:45,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:45,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:45,691 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-08 06:13:45,692 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-08 06:13:45,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 7 equivalence classes. [2025-02-08 06:13:45,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:13:45,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 06:13:45,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:45,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-08 06:13:45,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:46,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:13:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 18 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:46,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:46,491 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-08 06:13:46,493 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-08 06:13:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 18 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455844737] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:46,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:46,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2025-02-08 06:13:46,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043798332] [2025-02-08 06:13:46,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:46,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-08 06:13:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:46,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-08 06:13:46,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2215, Unknown=0, NotChecked=0, Total=2352 [2025-02-08 06:13:46,690 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 49 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:47,673 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2025-02-08 06:13:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:13:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 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 49 [2025-02-08 06:13:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:47,674 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:13:47,674 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 06:13:47,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=302, Invalid=4390, Unknown=0, NotChecked=0, Total=4692 [2025-02-08 06:13:47,675 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:47,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 289 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:13:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 06:13:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-02-08 06:13:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2025-02-08 06:13:47,677 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 49 [2025-02-08 06:13:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:47,677 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2025-02-08 06:13:47,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2025-02-08 06:13:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:13:47,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:47,677 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:47,684 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-08 06:13:47,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-08 06:13:47,881 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:47,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash 600621904, now seen corresponding path program 10 times [2025-02-08 06:13:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337003355] [2025-02-08 06:13:47,882 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:13:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:47,893 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:13:47,900 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:13:47,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 06:13:47,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 35 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337003355] [2025-02-08 06:13:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337003355] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215049153] [2025-02-08 06:13:48,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:13:48,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:48,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:48,289 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-08 06:13:48,290 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-08 06:13:48,351 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:13:48,446 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:13:48,447 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 06:13:48,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:48,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-08 06:13:48,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:48,483 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 1 [2025-02-08 06:13:48,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:13:48,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:13:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:49,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:49,938 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:13:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215049153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:49,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 51 [2025-02-08 06:13:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412583317] [2025-02-08 06:13:49,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:49,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-08 06:13:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:49,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-08 06:13:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2470, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 06:13:49,989 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 53 states, 52 states have (on average 3.0) internal successors, (156), 52 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:50,774 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-02-08 06:13:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 06:13:50,774 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.0) internal successors, (156), 52 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-08 06:13:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:50,775 INFO L225 Difference]: With dead ends: 63 [2025-02-08 06:13:50,775 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:13:50,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=378, Invalid=3162, Unknown=0, NotChecked=0, Total=3540 [2025-02-08 06:13:50,777 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:50,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 237 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:13:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:13:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2025-02-08 06:13:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2025-02-08 06:13:50,780 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2025-02-08 06:13:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:50,780 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2025-02-08 06:13:50,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.0) internal successors, (156), 52 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2025-02-08 06:13:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:13:50,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:50,783 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:50,792 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-08 06:13:50,983 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-08 06:13:50,984 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:50,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash 503466260, now seen corresponding path program 11 times [2025-02-08 06:13:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:50,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326304656] [2025-02-08 06:13:50,985 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:13:50,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:50,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 8 equivalence classes. [2025-02-08 06:13:51,003 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:13:51,003 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-08 06:13:51,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 91 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326304656] [2025-02-08 06:13:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326304656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775671095] [2025-02-08 06:13:51,408 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:13:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:51,411 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-08 06:13:51,411 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-08 06:13:51,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 8 equivalence classes. [2025-02-08 06:13:51,640 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:13:51,640 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-08 06:13:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:51,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 06:13:51,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:51,818 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-08 06:13:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 21 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:52,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:52,078 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-08 06:13:52,079 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-08 06:13:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 21 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775671095] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:52,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 41 [2025-02-08 06:13:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513061701] [2025-02-08 06:13:52,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:52,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-08 06:13:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:52,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-08 06:13:52,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1522, Unknown=0, NotChecked=0, Total=1640 [2025-02-08 06:13:52,158 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:53,089 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2025-02-08 06:13:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 06:13:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 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 56 [2025-02-08 06:13:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:53,090 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:13:53,090 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 06:13:53,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=319, Invalid=3841, Unknown=0, NotChecked=0, Total=4160 [2025-02-08 06:13:53,091 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:53,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 297 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:13:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 06:13:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-02-08 06:13:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 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-08 06:13:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2025-02-08 06:13:53,092 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 56 [2025-02-08 06:13:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:53,093 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2025-02-08 06:13:53,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2025-02-08 06:13:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 06:13:53,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:53,093 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:53,100 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-08 06:13:53,297 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-08 06:13:53,297 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:53,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash -27763823, now seen corresponding path program 12 times [2025-02-08 06:13:53,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568578926] [2025-02-08 06:13:53,298 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:13:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:53,309 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 8 equivalence classes. [2025-02-08 06:13:53,323 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:13:53,324 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 06:13:53,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568578926] [2025-02-08 06:13:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568578926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493506877] [2025-02-08 06:13:53,732 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:13:53,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:53,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:53,734 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-08 06:13:53,736 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-08 06:13:53,806 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 8 equivalence classes. [2025-02-08 06:13:54,043 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:13:54,043 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 06:13:54,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:54,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-02-08 06:13:54,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:54,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:13:54,094 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 1 [2025-02-08 06:13:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:55,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493506877] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:56,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 60 [2025-02-08 06:13:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030998950] [2025-02-08 06:13:56,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:56,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-02-08 06:13:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:56,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-02-08 06:13:56,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3443, Unknown=0, NotChecked=0, Total=3782 [2025-02-08 06:13:56,881 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 62 states, 61 states have (on average 2.901639344262295) internal successors, (177), 61 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:58,483 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2025-02-08 06:13:58,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:13:58,483 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.901639344262295) internal successors, (177), 61 states have internal predecessors, (177), 0 states have call successors, (0), 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-08 06:13:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:58,484 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:13:58,484 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 06:13:58,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=682, Invalid=6124, Unknown=0, NotChecked=0, Total=6806 [2025-02-08 06:13:58,486 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:58,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 241 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 06:13:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 06:13:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-02-08 06:13:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2025-02-08 06:13:58,489 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 59 [2025-02-08 06:13:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:58,490 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2025-02-08 06:13:58,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.901639344262295) internal successors, (177), 61 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2025-02-08 06:13:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 06:13:58,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:58,490 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:58,499 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-08 06:13:58,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:58,691 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:13:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash 479582421, now seen corresponding path program 13 times [2025-02-08 06:13:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876591827] [2025-02-08 06:13:58,692 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:13:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:58,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:13:58,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:13:58,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:58,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 106 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:59,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876591827] [2025-02-08 06:13:59,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876591827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:59,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841080542] [2025-02-08 06:13:59,346 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:13:59,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:59,348 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-08 06:13:59,350 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-08 06:13:59,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:13:59,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:13:59,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:59,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:59,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 06:13:59,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:59,647 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-08 06:13:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 24 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:13:59,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:59,962 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-08 06:13:59,963 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-08 06:14:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 24 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841080542] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:00,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:00,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2025-02-08 06:14:00,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309690603] [2025-02-08 06:14:00,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:00,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-08 06:14:00,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:00,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-08 06:14:00,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:14:00,052 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 44 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 44 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-08 06:14:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:01,138 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2025-02-08 06:14:01,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 06:14:01,139 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 44 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) Word has length 63 [2025-02-08 06:14:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:01,139 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:14:01,139 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:14:01,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=337, Invalid=4355, Unknown=0, NotChecked=0, Total=4692 [2025-02-08 06:14:01,140 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:01,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 342 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:14:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:14:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-02-08 06:14:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2025-02-08 06:14:01,142 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 63 [2025-02-08 06:14:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:01,142 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2025-02-08 06:14:01,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 44 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-08 06:14:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2025-02-08 06:14:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:14:01,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:01,142 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:01,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-08 06:14:01,348 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,SelfDestructingSolverStorable34 [2025-02-08 06:14:01,348 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:01,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash -577081416, now seen corresponding path program 14 times [2025-02-08 06:14:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:01,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262183042] [2025-02-08 06:14:01,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:14:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:01,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 06:14:01,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:14:01,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:14:01,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 51 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:01,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262183042] [2025-02-08 06:14:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262183042] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662883562] [2025-02-08 06:14:01,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:14:01,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:01,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:01,872 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-08 06:14:01,873 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-08 06:14:01,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 06:14:01,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:14:01,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:14:01,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:01,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-02-08 06:14:01,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:02,022 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 1 [2025-02-08 06:14:02,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:14:02,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:14:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:03,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:04,177 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:14:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:04,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662883562] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:04,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:04,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 22] total 63 [2025-02-08 06:14:04,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255981361] [2025-02-08 06:14:04,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:04,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-08 06:14:04,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:04,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-08 06:14:04,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=3733, Unknown=0, NotChecked=0, Total=4160 [2025-02-08 06:14:04,225 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 65 states, 64 states have (on average 3.09375) internal successors, (198), 64 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:05,145 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-02-08 06:14:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 06:14:05,145 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 3.09375) internal successors, (198), 64 states have internal predecessors, (198), 0 states have call successors, (0), 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 66 [2025-02-08 06:14:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:05,145 INFO L225 Difference]: With dead ends: 77 [2025-02-08 06:14:05,145 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 06:14:05,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=553, Invalid=4849, Unknown=0, NotChecked=0, Total=5402 [2025-02-08 06:14:05,146 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:05,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 275 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:14:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 06:14:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-02-08 06:14:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2025-02-08 06:14:05,148 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2025-02-08 06:14:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:05,148 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2025-02-08 06:14:05,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 3.09375) internal successors, (198), 64 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2025-02-08 06:14:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 06:14:05,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:05,148 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:05,157 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-08 06:14:05,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:05,349 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:05,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1496088196, now seen corresponding path program 15 times [2025-02-08 06:14:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:05,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791775058] [2025-02-08 06:14:05,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:14:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:05,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 10 equivalence classes. [2025-02-08 06:14:05,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 06:14:05,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-08 06:14:05,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 137 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:05,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:05,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791775058] [2025-02-08 06:14:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791775058] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:05,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787792040] [2025-02-08 06:14:05,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:14:05,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:05,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:05,980 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-08 06:14:05,981 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-08 06:14:06,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 10 equivalence classes. [2025-02-08 06:14:06,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 06:14:06,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-08 06:14:06,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:06,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 06:14:06,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:06,715 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-08 06:14:07,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:14:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 27 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:07,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:07,084 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-08 06:14:07,085 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-08 06:14:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 27 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:07,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787792040] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:07,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2025-02-08 06:14:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619600810] [2025-02-08 06:14:07,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:07,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 06:14:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:07,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 06:14:07,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:14:07,181 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 48 states, 48 states have (on average 2.9166666666666665) internal successors, (140), 48 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:08,514 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2025-02-08 06:14:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 06:14:08,514 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.9166666666666665) internal successors, (140), 48 states have internal predecessors, (140), 0 states have call successors, (0), 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 70 [2025-02-08 06:14:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:08,515 INFO L225 Difference]: With dead ends: 114 [2025-02-08 06:14:08,515 INFO L226 Difference]: Without dead ends: 76 [2025-02-08 06:14:08,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=392, Invalid=5308, Unknown=0, NotChecked=0, Total=5700 [2025-02-08 06:14:08,515 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:08,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 404 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:14:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-08 06:14:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-02-08 06:14:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 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-08 06:14:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2025-02-08 06:14:08,516 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 70 [2025-02-08 06:14:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:08,517 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2025-02-08 06:14:08,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.9166666666666665) internal successors, (140), 48 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2025-02-08 06:14:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 06:14:08,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:08,519 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:08,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-08 06:14:08,720 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,SelfDestructingSolverStorable36 [2025-02-08 06:14:08,720 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:08,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2042301127, now seen corresponding path program 16 times [2025-02-08 06:14:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602469712] [2025-02-08 06:14:08,720 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:14:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:08,730 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 73 statements into 2 equivalence classes. [2025-02-08 06:14:08,744 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 06:14:08,745 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 06:14:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-08 06:14:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602469712] [2025-02-08 06:14:14,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602469712] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939195364] [2025-02-08 06:14:14,964 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:14:14,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:14,966 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-08 06:14:14,967 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-08 06:14:15,056 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 73 statements into 2 equivalence classes. [2025-02-08 06:14:15,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 06:14:15,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 06:14:15,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:15,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-08 06:14:15,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:15,299 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 1 [2025-02-08 06:14:15,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:14:15,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:14:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 92 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:16,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:18,433 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:14:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 117 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939195364] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:18,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 22] total 68 [2025-02-08 06:14:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635093404] [2025-02-08 06:14:18,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:18,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-02-08 06:14:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:18,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-02-08 06:14:18,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=4463, Unknown=0, NotChecked=0, Total=4830 [2025-02-08 06:14:18,511 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 70 states, 69 states have (on average 2.8260869565217392) internal successors, (195), 69 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:20,466 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2025-02-08 06:14:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 06:14:20,466 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.8260869565217392) internal successors, (195), 69 states have internal predecessors, (195), 0 states have call successors, (0), 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 73 [2025-02-08 06:14:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:20,467 INFO L225 Difference]: With dead ends: 79 [2025-02-08 06:14:20,467 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 06:14:20,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=575, Invalid=6067, Unknown=0, NotChecked=0, Total=6642 [2025-02-08 06:14:20,468 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:20,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 431 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 06:14:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 06:14:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-02-08 06:14:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2025-02-08 06:14:20,469 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 73 [2025-02-08 06:14:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:20,469 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2025-02-08 06:14:20,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.8260869565217392) internal successors, (195), 69 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2025-02-08 06:14:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-08 06:14:20,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:20,470 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:20,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-08 06:14:20,670 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,SelfDestructingSolverStorable37 [2025-02-08 06:14:20,670 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:20,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1137532541, now seen corresponding path program 17 times [2025-02-08 06:14:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:20,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326913316] [2025-02-08 06:14:20,671 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:14:20,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:20,680 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 11 equivalence classes. [2025-02-08 06:14:20,696 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 06:14:20,696 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 06:14:20,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 190 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:21,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326913316] [2025-02-08 06:14:21,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326913316] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820558460] [2025-02-08 06:14:21,371 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:14:21,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:21,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:21,373 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-08 06:14:21,374 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-08 06:14:21,464 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 11 equivalence classes. [2025-02-08 06:14:22,629 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 06:14:22,629 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 06:14:22,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:22,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-08 06:14:22,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:22,914 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-08 06:14:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 30 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:23,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:23,354 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-08 06:14:23,355 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-08 06:14:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 30 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:23,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820558460] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:23,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:23,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 53 [2025-02-08 06:14:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046759056] [2025-02-08 06:14:23,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:23,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-08 06:14:23,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:23,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-08 06:14:23,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2587, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 06:14:23,459 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:25,071 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2025-02-08 06:14:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:14:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 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 77 [2025-02-08 06:14:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:25,072 INFO L225 Difference]: With dead ends: 125 [2025-02-08 06:14:25,072 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 06:14:25,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=493, Invalid=6817, Unknown=0, NotChecked=0, Total=7310 [2025-02-08 06:14:25,073 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:25,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 477 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 06:14:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 06:14:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-02-08 06:14:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2025-02-08 06:14:25,074 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2025-02-08 06:14:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:25,075 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2025-02-08 06:14:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2025-02-08 06:14:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 06:14:25,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:25,075 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:25,083 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-08 06:14:25,278 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,SelfDestructingSolverStorable38 [2025-02-08 06:14:25,279 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 732081184, now seen corresponding path program 18 times [2025-02-08 06:14:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490199992] [2025-02-08 06:14:25,279 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:14:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:25,288 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 80 statements into 11 equivalence classes. [2025-02-08 06:14:25,309 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 06:14:25,309 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-08 06:14:25,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 92 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:25,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:25,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490199992] [2025-02-08 06:14:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490199992] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105151250] [2025-02-08 06:14:25,815 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:14:25,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:25,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:25,817 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-08 06:14:25,818 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-08 06:14:25,909 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 80 statements into 11 equivalence classes. [2025-02-08 06:14:26,494 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 06:14:26,494 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-08 06:14:26,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:26,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-02-08 06:14:26,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:26,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:14:26,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:14:26,541 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 1 [2025-02-08 06:14:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:28,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:30,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105151250] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:30,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:30,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 27] total 77 [2025-02-08 06:14:30,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689590699] [2025-02-08 06:14:30,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:30,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-02-08 06:14:30,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:30,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-02-08 06:14:30,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=5596, Unknown=0, NotChecked=0, Total=6162 [2025-02-08 06:14:30,387 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 79 states, 78 states have (on average 3.076923076923077) internal successors, (240), 78 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:32,746 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2025-02-08 06:14:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 06:14:32,746 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 3.076923076923077) internal successors, (240), 78 states have internal predecessors, (240), 0 states have call successors, (0), 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 80 [2025-02-08 06:14:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:32,747 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:14:32,747 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:14:32,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1089, Invalid=9831, Unknown=0, NotChecked=0, Total=10920 [2025-02-08 06:14:32,752 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 73 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:32,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 392 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 06:14:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:14:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2025-02-08 06:14:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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-08 06:14:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2025-02-08 06:14:32,758 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2025-02-08 06:14:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:32,759 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2025-02-08 06:14:32,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.076923076923077) internal successors, (240), 78 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2025-02-08 06:14:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 06:14:32,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:32,759 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:32,768 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-08 06:14:32,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-08 06:14:32,960 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:32,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:32,960 INFO L85 PathProgramCache]: Analyzing trace with hash 68635108, now seen corresponding path program 19 times [2025-02-08 06:14:32,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:32,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270730120] [2025-02-08 06:14:32,960 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:14:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:32,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 06:14:32,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 06:14:32,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:14:32,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 211 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:33,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:33,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270730120] [2025-02-08 06:14:33,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270730120] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:33,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050336868] [2025-02-08 06:14:33,791 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:14:33,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:33,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:33,794 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-08 06:14:33,795 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-08 06:14:33,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 06:14:33,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 06:14:33,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:14:33,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:33,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-08 06:14:33,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:34,185 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-08 06:14:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 33 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:34,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:34,596 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-08 06:14:34,598 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-08 06:14:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 33 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050336868] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:34,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:34,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2025-02-08 06:14:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593673970] [2025-02-08 06:14:34,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:34,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-08 06:14:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:34,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-08 06:14:34,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2904, Unknown=0, NotChecked=0, Total=3080 [2025-02-08 06:14:34,710 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 56 states, 56 states have (on average 3.0) internal successors, (168), 56 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:36,695 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2025-02-08 06:14:36,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-08 06:14:36,695 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.0) internal successors, (168), 56 states have internal predecessors, (168), 0 states have call successors, (0), 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 84 [2025-02-08 06:14:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:36,696 INFO L225 Difference]: With dead ends: 136 [2025-02-08 06:14:36,696 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:14:36,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=514, Invalid=7496, Unknown=0, NotChecked=0, Total=8010 [2025-02-08 06:14:36,696 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:36,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 554 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 06:14:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:14:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-02-08 06:14:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 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-08 06:14:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2025-02-08 06:14:36,698 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 84 [2025-02-08 06:14:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:36,698 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2025-02-08 06:14:36,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.0) internal successors, (168), 56 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2025-02-08 06:14:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 06:14:36,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:36,699 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:36,708 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-08 06:14:36,903 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,SelfDestructingSolverStorable40 [2025-02-08 06:14:36,903 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:36,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1904275169, now seen corresponding path program 20 times [2025-02-08 06:14:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457048932] [2025-02-08 06:14:36,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:14:36,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:36,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-08 06:14:36,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 06:14:36,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:14:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 117 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457048932] [2025-02-08 06:14:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457048932] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160266440] [2025-02-08 06:14:37,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:14:37,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:37,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:37,695 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-08 06:14:37,696 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-08 06:14:37,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-08 06:14:37,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 06:14:37,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:14:37,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:37,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-02-08 06:14:37,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:37,872 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 1 [2025-02-08 06:14:37,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:14:37,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:14:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:39,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:41,148 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:14:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:41,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160266440] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:41,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:41,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 28] total 81 [2025-02-08 06:14:41,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376634491] [2025-02-08 06:14:41,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:41,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-02-08 06:14:41,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:41,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-02-08 06:14:41,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=6145, Unknown=0, NotChecked=0, Total=6806 [2025-02-08 06:14:41,208 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 83 states, 82 states have (on average 3.182926829268293) internal successors, (261), 82 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:42,897 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2025-02-08 06:14:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-08 06:14:42,897 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 3.182926829268293) internal successors, (261), 82 states have internal predecessors, (261), 0 states have call successors, (0), 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 87 [2025-02-08 06:14:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:42,898 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:14:42,898 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:14:42,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2670 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=862, Invalid=8068, Unknown=0, NotChecked=0, Total=8930 [2025-02-08 06:14:42,898 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:42,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 500 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 06:14:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:14:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2025-02-08 06:14:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 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-08 06:14:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2025-02-08 06:14:42,900 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2025-02-08 06:14:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:42,900 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2025-02-08 06:14:42,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 3.182926829268293) internal successors, (261), 82 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2025-02-08 06:14:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 06:14:42,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:42,900 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:42,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-02-08 06:14:43,105 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,SelfDestructingSolverStorable41 [2025-02-08 06:14:43,105 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:43,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -677100507, now seen corresponding path program 21 times [2025-02-08 06:14:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:43,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925365493] [2025-02-08 06:14:43,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:14:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:43,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 13 equivalence classes. [2025-02-08 06:14:43,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 06:14:43,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-08 06:14:43,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 254 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925365493] [2025-02-08 06:14:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925365493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307478453] [2025-02-08 06:14:44,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:14:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:44,007 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-08 06:14:44,008 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-08 06:14:44,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 13 equivalence classes. [2025-02-08 06:14:46,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 06:14:46,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-08 06:14:46,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:46,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-08 06:14:46,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:46,637 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-08 06:14:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 36 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:47,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:47,210 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-08 06:14:47,211 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-08 06:14:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 36 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307478453] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:47,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2025-02-08 06:14:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193818728] [2025-02-08 06:14:47,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:47,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-08 06:14:47,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:47,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-08 06:14:47,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3345, Unknown=0, NotChecked=0, Total=3540 [2025-02-08 06:14:47,330 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 60 states, 60 states have (on average 3.033333333333333) internal successors, (182), 60 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:49,669 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2025-02-08 06:14:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-08 06:14:49,669 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 3.033333333333333) internal successors, (182), 60 states have internal predecessors, (182), 0 states have call successors, (0), 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 91 [2025-02-08 06:14:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:49,672 INFO L225 Difference]: With dead ends: 147 [2025-02-08 06:14:49,672 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:14:49,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=581, Invalid=8731, Unknown=0, NotChecked=0, Total=9312 [2025-02-08 06:14:49,673 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 3220 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 3252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:49,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 709 Invalid, 3252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3220 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 06:14:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:14:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-02-08 06:14:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2025-02-08 06:14:49,675 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 91 [2025-02-08 06:14:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2025-02-08 06:14:49,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.033333333333333) internal successors, (182), 60 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2025-02-08 06:14:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 06:14:49,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:49,675 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:49,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-02-08 06:14:49,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:49,876 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:49,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash 476280968, now seen corresponding path program 22 times [2025-02-08 06:14:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296518010] [2025-02-08 06:14:49,876 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:14:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:49,886 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-02-08 06:14:49,915 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 06:14:49,915 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 06:14:49,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 176 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:50,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296518010] [2025-02-08 06:14:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296518010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093786002] [2025-02-08 06:14:50,771 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:14:50,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:50,773 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-08 06:14:50,775 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-08 06:14:50,878 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-02-08 06:14:51,145 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 06:14:51,146 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 06:14:51,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:51,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-02-08 06:14:51,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:51,182 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 1 [2025-02-08 06:14:51,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:14:51,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:14:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 176 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:53,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:54,557 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:14:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 210 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:54,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093786002] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:14:54,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:14:54,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 28] total 83 [2025-02-08 06:14:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370756011] [2025-02-08 06:14:54,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:14:54,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-02-08 06:14:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:54,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-02-08 06:14:54,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=6387, Unknown=0, NotChecked=0, Total=7140 [2025-02-08 06:14:54,629 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 85 states, 84 states have (on average 3.357142857142857) internal successors, (282), 84 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:55,658 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2025-02-08 06:14:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 06:14:55,658 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 3.357142857142857) internal successors, (282), 84 states have internal predecessors, (282), 0 states have call successors, (0), 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 94 [2025-02-08 06:14:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:55,659 INFO L225 Difference]: With dead ends: 100 [2025-02-08 06:14:55,659 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 06:14:55,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2291 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=794, Invalid=6516, Unknown=0, NotChecked=0, Total=7310 [2025-02-08 06:14:55,660 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:55,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 413 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:14:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 06:14:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-08 06:14:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 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-08 06:14:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2025-02-08 06:14:55,661 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2025-02-08 06:14:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:55,662 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2025-02-08 06:14:55,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 3.357142857142857) internal successors, (282), 84 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:14:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2025-02-08 06:14:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 06:14:55,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:55,662 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:55,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-02-08 06:14:55,862 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,SelfDestructingSolverStorable43 [2025-02-08 06:14:55,863 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-08 06:14:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash -716463540, now seen corresponding path program 23 times [2025-02-08 06:14:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339602612] [2025-02-08 06:14:55,863 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:14:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:55,874 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 14 equivalence classes. [2025-02-08 06:14:55,895 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 06:14:55,896 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-08 06:14:55,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 325 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339602612] [2025-02-08 06:14:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339602612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883656505] [2025-02-08 06:14:56,819 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:14:56,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:56,821 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-08 06:14:56,822 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-08 06:14:56,931 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 14 equivalence classes. [2025-02-08 06:14:58,775 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 06:14:58,775 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-08 06:14:58,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:58,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-02-08 06:14:58,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:59,196 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-08 06:14:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 39 proven. 522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:59,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:14:59,858 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-08 06:14:59,860 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