./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.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 fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:04:58,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:04:59,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:04:59,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:04:59,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:04:59,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:04:59,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:04:59,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:04:59,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:04:59,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:04:59,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:04:59,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:04:59,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:04:59,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:04:59,061 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:04:59,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:04:59,061 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:04:59,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:04:59,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:04:59,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:04:59,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:04:59,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:04:59,063 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 -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2025-02-06 10:04:59,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:04:59,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:04:59,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:04:59,281 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:04:59,282 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:04:59,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2025-02-06 10:05:00,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb76e8e7d/23cb3ec80a7842829f427d5062550fdd/FLAGa70ee9991 [2025-02-06 10:05:00,703 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:05:00,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2025-02-06 10:05:00,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb76e8e7d/23cb3ec80a7842829f427d5062550fdd/FLAGa70ee9991 [2025-02-06 10:05:00,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb76e8e7d/23cb3ec80a7842829f427d5062550fdd [2025-02-06 10:05:00,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:05:00,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:05:00,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:05:00,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:05:00,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:05:00,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:05:00" (1/1) ... [2025-02-06 10:05:00,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106a80ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:00, skipping insertion in model container [2025-02-06 10:05:00,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:05:00" (1/1) ... [2025-02-06 10:05:01,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:05:01,223 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:05:01,225 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:05:01,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:05:01,238 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:05:01,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:05:01,304 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:05:01,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01 WrapperNode [2025-02-06 10:05:01,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:05:01,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:05:01,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:05:01,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:05:01,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,339 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-02-06 10:05:01,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:05:01,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:05:01,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:05:01,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:05:01,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,363 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [3, 1]. 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 [2, 1]. [2025-02-06 10:05:01,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:05:01,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:05:01,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:05:01,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:05:01,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:05:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:01,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:05:01,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:05:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:05:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:05:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:05:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:05:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:05:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:05:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:05:01,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:05:01,514 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:05:01,516 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:05:01,646 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L532: 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-06 10:05:01,655 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-06 10:05:01,655 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:05:01,661 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:05:01,661 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:05:01,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:05:01 BoogieIcfgContainer [2025-02-06 10:05:01,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:05:01,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:05:01,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:05:01,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:05:01,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:05:00" (1/3) ... [2025-02-06 10:05:01,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b0d102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:05:01, skipping insertion in model container [2025-02-06 10:05:01,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (2/3) ... [2025-02-06 10:05:01,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b0d102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:05:01, skipping insertion in model container [2025-02-06 10:05:01,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:05:01" (3/3) ... [2025-02-06 10:05:01,668 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2025-02-06 10:05:01,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:05:01,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcpy-alloca-1.i that has 1 procedures, 28 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-02-06 10:05:01,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:05:01,710 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;@625bed64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:05:01,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 10:05:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 27 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-06 10:05:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:05:01,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:01,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:05:01,716 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-06 10:05:01,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1981073570, now seen corresponding path program 1 times [2025-02-06 10:05:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:01,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984636954] [2025-02-06 10:05:01,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:01,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:01,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:05:01,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:05:01,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:01,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:01,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984636954] [2025-02-06 10:05:01,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984636954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:01,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:01,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324745573] [2025-02-06 10:05:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:01,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:01,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:01,854 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 27 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) 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-06 10:05:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:01,894 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-02-06 10:05:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:01,895 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-06 10:05:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:01,899 INFO L225 Difference]: With dead ends: 29 [2025-02-06 10:05:01,899 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 10:05:01,900 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-06 10:05:01,902 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 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-06 10:05:01,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 10:05:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-06 10:05:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 26 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-06 10:05:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-02-06 10:05:01,921 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 6 [2025-02-06 10:05:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:01,921 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-02-06 10:05:01,921 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-06 10:05:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-02-06 10:05:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:05:01,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:01,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:05:01,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:05:01,922 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-06 10:05:01,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1981074531, now seen corresponding path program 1 times [2025-02-06 10:05:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:01,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683340769] [2025-02-06 10:05:01,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:01,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:05:01,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:05:01,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:01,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683340769] [2025-02-06 10:05:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683340769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:01,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:01,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:05:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477296302] [2025-02-06 10:05:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:05:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:01,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:05:01,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:01,945 INFO L87 Difference]: Start difference. First operand 27 states and 31 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-06 10:05:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:01,960 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-02-06 10:05:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:05:01,961 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-06 10:05:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:01,961 INFO L225 Difference]: With dead ends: 28 [2025-02-06 10:05:01,961 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 10:05:01,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:01,962 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 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-06 10:05:01,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 10:05:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-06 10:05:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 25 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-06 10:05:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-02-06 10:05:01,965 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2025-02-06 10:05:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:01,965 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-02-06 10:05:01,965 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-06 10:05:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-02-06 10:05:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:01,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:01,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:05:01,966 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-06 10:05:01,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1283741087, now seen corresponding path program 1 times [2025-02-06 10:05:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178347557] [2025-02-06 10:05:01,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:01,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:01,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:01,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:01,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178347557] [2025-02-06 10:05:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178347557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:05:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350297000] [2025-02-06 10:05:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:05:02,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:05:02,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:02,027 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,045 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-02-06 10:05:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:05:02,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,046 INFO L225 Difference]: With dead ends: 24 [2025-02-06 10:05:02,046 INFO L226 Difference]: Without dead ends: 24 [2025-02-06 10:05:02,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:02,046 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-06 10:05:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-06 10:05:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.588235294117647) 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-06 10:05:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-06 10:05:02,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2025-02-06 10:05:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,049 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-06 10:05:02,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-02-06 10:05:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:02,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:05:02,050 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-06 10:05:02,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1283741088, now seen corresponding path program 1 times [2025-02-06 10:05:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681967362] [2025-02-06 10:05:02,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:02,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:02,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:02,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681967362] [2025-02-06 10:05:02,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681967362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69592052] [2025-02-06 10:05:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:02,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:02,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,238 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,258 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-02-06 10:05:02,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:02,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,259 INFO L225 Difference]: With dead ends: 30 [2025-02-06 10:05:02,259 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 10:05:02,259 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-06 10:05:02,259 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 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-06 10:05:02,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 10:05:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-02-06 10:05:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-06 10:05:02,262 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 7 [2025-02-06 10:05:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,262 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-06 10:05:02,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-06 10:05:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:02,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:05:02,263 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-06 10:05:02,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1283741248, now seen corresponding path program 1 times [2025-02-06 10:05:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58869959] [2025-02-06 10:05:02,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:02,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:02,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:02,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58869959] [2025-02-06 10:05:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58869959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996066363] [2025-02-06 10:05:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:02,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:02,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,306 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,318 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-02-06 10:05:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,319 INFO L225 Difference]: With dead ends: 27 [2025-02-06 10:05:02,319 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 10:05:02,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,320 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 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-06 10:05:02,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 10:05:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-06 10:05:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-02-06 10:05:02,325 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 7 [2025-02-06 10:05:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,325 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-02-06 10:05:02,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-02-06 10:05:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:02,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:05:02,326 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-06 10:05:02,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1283770879, now seen corresponding path program 1 times [2025-02-06 10:05:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106075643] [2025-02-06 10:05:02,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:02,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:02,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106075643] [2025-02-06 10:05:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106075643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127095110] [2025-02-06 10:05:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:02,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:02,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:02,420 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,443 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-02-06 10:05:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:02,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:02,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,444 INFO L225 Difference]: With dead ends: 26 [2025-02-06 10:05:02,444 INFO L226 Difference]: Without dead ends: 26 [2025-02-06 10:05:02,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-06 10:05:02,444 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-06 10:05:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-02-06 10:05:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.4736842105263157) 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-06 10:05:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-02-06 10:05:02,446 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2025-02-06 10:05:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-02-06 10:05:02,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-02-06 10:05:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:02,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:05:02,447 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-06 10:05:02,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1283771039, now seen corresponding path program 1 times [2025-02-06 10:05:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943180500] [2025-02-06 10:05:02,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:02,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:02,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943180500] [2025-02-06 10:05:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943180500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994085374] [2025-02-06 10:05:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:02,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,480 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,495 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-02-06 10:05:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:02,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,497 INFO L225 Difference]: With dead ends: 30 [2025-02-06 10:05:02,497 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 10:05:02,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,497 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 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-06 10:05:02,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 10:05:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-02-06 10:05:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-02-06 10:05:02,500 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2025-02-06 10:05:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,500 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-06 10:05:02,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-02-06 10:05:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:02,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:05:02,501 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-06 10:05:02,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1284694560, now seen corresponding path program 1 times [2025-02-06 10:05:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640601586] [2025-02-06 10:05:02,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:02,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640601586] [2025-02-06 10:05:02,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640601586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152831610] [2025-02-06 10:05:02,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:02,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:02,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:02,584 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,626 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-02-06 10:05:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:02,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,627 INFO L225 Difference]: With dead ends: 29 [2025-02-06 10:05:02,627 INFO L226 Difference]: Without dead ends: 29 [2025-02-06 10:05:02,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-06 10:05:02,627 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-06 10:05:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-02-06 10:05:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 27 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-06 10:05:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-02-06 10:05:02,629 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 7 [2025-02-06 10:05:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,630 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-02-06 10:05:02,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-02-06 10:05:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:05:02,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:05:02,630 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-06 10:05:02,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1541906257, now seen corresponding path program 1 times [2025-02-06 10:05:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598714616] [2025-02-06 10:05:02,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:05:02,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:05:02,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598714616] [2025-02-06 10:05:02,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598714616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827462848] [2025-02-06 10:05:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:02,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:02,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:02,731 INFO L87 Difference]: Start difference. First operand 28 states and 33 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-06 10:05:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,772 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-02-06 10:05:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:02,773 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-06 10:05:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,773 INFO L225 Difference]: With dead ends: 27 [2025-02-06 10:05:02,773 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 10:05:02,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:02,774 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 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-06 10:05:02,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 10:05:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-06 10:05:02,775 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-06 10:05:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-02-06 10:05:02,775 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 10 [2025-02-06 10:05:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,776 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-02-06 10:05:02,776 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-06 10:05:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-02-06 10:05:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:05:02,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:05:02,776 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-06 10:05:02,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1541906258, now seen corresponding path program 1 times [2025-02-06 10:05:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597316899] [2025-02-06 10:05:02,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:05:02,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:05:02,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:02,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597316899] [2025-02-06 10:05:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597316899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:05:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149382954] [2025-02-06 10:05:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:05:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:05:02,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:02,875 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,931 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-02-06 10:05:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:05:02,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:05:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,933 INFO L225 Difference]: With dead ends: 30 [2025-02-06 10:05:02,933 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 10:05:02,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:05:02,934 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 61 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 10:05:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-02-06 10:05:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-06 10:05:02,935 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2025-02-06 10:05:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,935 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-06 10:05:02,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-06 10:05:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:05:02,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,936 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:05:02,936 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-06 10:05:02,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -117975305, now seen corresponding path program 1 times [2025-02-06 10:05:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848040225] [2025-02-06 10:05:02,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:05:02,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:05:02,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848040225] [2025-02-06 10:05:03,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848040225] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830373254] [2025-02-06 10:05:03,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:03,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:03,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:03,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:03,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:05:03,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:05:03,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:05:03,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:03,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:03,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:05:03,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:03,328 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-06 10:05:03,336 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-06 10:05:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:03,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:03,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830373254] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:03,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:03,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 10:05:03,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596122910] [2025-02-06 10:05:03,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:03,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:05:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:03,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:05:03,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:05:03,598 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:03,745 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-02-06 10:05:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:05:03,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:05:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:03,746 INFO L225 Difference]: With dead ends: 30 [2025-02-06 10:05:03,746 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 10:05:03,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:05:03,746 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:03,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 10:05:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-02-06 10:05:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-02-06 10:05:03,748 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 10 [2025-02-06 10:05:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:03,749 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-06 10:05:03,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-02-06 10:05:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:05:03,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:03,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:03,756 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-06 10:05:03,954 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-06 10:05:03,955 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-06 10:05:03,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash 554453690, now seen corresponding path program 1 times [2025-02-06 10:05:03,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:03,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856663676] [2025-02-06 10:05:03,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:03,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:03,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:03,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:03,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:03,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:04,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856663676] [2025-02-06 10:05:04,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856663676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:04,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:04,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:05:04,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401677193] [2025-02-06 10:05:04,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:04,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:05:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:04,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:05:04,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:04,050 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:04,082 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-02-06 10:05:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:04,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:05:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:04,083 INFO L225 Difference]: With dead ends: 25 [2025-02-06 10:05:04,083 INFO L226 Difference]: Without dead ends: 25 [2025-02-06 10:05:04,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:04,084 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:04,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-06 10:05:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-06 10:05:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.3181818181818181) 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-06 10:05:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-06 10:05:04,086 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2025-02-06 10:05:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:04,086 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-06 10:05:04,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-06 10:05:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:05:04,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:04,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:04,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:05:04,086 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-06 10:05:04,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash 554453691, now seen corresponding path program 1 times [2025-02-06 10:05:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135266459] [2025-02-06 10:05:04,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:04,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:04,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:04,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:04,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:04,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135266459] [2025-02-06 10:05:04,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135266459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:04,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:04,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:05:04,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831809656] [2025-02-06 10:05:04,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:04,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:05:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:04,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:05:04,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:04,245 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:04,282 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-02-06 10:05:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:05:04,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:05:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:04,283 INFO L225 Difference]: With dead ends: 32 [2025-02-06 10:05:04,283 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 10:05:04,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:04,283 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:04,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 10:05:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 10:05:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-02-06 10:05:04,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2025-02-06 10:05:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:04,285 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-06 10:05:04,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-02-06 10:05:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:05:04,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:04,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:04,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:05:04,285 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-06 10:05:04,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1253000772, now seen corresponding path program 1 times [2025-02-06 10:05:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387417690] [2025-02-06 10:05:04,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:04,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:04,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:04,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:04,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:04,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387417690] [2025-02-06 10:05:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387417690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:04,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:05:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083724766] [2025-02-06 10:05:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:04,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:05:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:04,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:05:04,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:04,421 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:04,453 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-02-06 10:05:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:05:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:05:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:04,453 INFO L225 Difference]: With dead ends: 33 [2025-02-06 10:05:04,453 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 10:05:04,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:04,454 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:04,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 10:05:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2025-02-06 10:05:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-02-06 10:05:04,456 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2025-02-06 10:05:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:04,456 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-06 10:05:04,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-02-06 10:05:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:05:04,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:04,456 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:04,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:05:04,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:05:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash -714364211, now seen corresponding path program 1 times [2025-02-06 10:05:04,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:04,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681176770] [2025-02-06 10:05:04,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:04,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:05:04,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:05:04,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:04,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:04,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681176770] [2025-02-06 10:05:04,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681176770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:04,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:04,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:05:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315927770] [2025-02-06 10:05:04,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:04,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:05:04,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:04,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:05:04,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:05:04,582 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:04,618 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-02-06 10:05:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:05:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:05:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:04,618 INFO L225 Difference]: With dead ends: 34 [2025-02-06 10:05:04,618 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 10:05:04,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:05:04,619 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:04,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 10:05:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 10:05:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-02-06 10:05:04,620 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2025-02-06 10:05:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:04,620 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-02-06 10:05:04,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-02-06 10:05:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:05:04,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:04,621 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:04,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:05:04,621 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-06 10:05:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1783651726, now seen corresponding path program 1 times [2025-02-06 10:05:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668620774] [2025-02-06 10:05:04,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:04,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:05:04,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:05:04,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:04,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668620774] [2025-02-06 10:05:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668620774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:04,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:04,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:05:04,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571367291] [2025-02-06 10:05:04,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:04,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:05:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:04,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:05:04,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:04,755 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:04,795 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-02-06 10:05:04,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:05:04,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:05:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:04,796 INFO L225 Difference]: With dead ends: 48 [2025-02-06 10:05:04,796 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 10:05:04,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:04,797 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:04,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 10:05:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-02-06 10:05:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-02-06 10:05:04,799 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2025-02-06 10:05:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:04,799 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-06 10:05:04,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-02-06 10:05:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:05:04,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:04,800 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:04,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:05:04,800 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-06 10:05:04,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1912734445, now seen corresponding path program 1 times [2025-02-06 10:05:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:04,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520233543] [2025-02-06 10:05:04,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:04,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:04,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:05:04,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:05:04,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:04,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:05,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:05,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520233543] [2025-02-06 10:05:05,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520233543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:05,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:05,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:05:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368872919] [2025-02-06 10:05:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:05,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:05:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:05,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:05:05,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:05,017 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:05,079 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-02-06 10:05:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:05:05,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:05:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:05,079 INFO L225 Difference]: With dead ends: 41 [2025-02-06 10:05:05,079 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 10:05:05,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:05,080 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:05,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 10:05:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-02-06 10:05:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-02-06 10:05:05,081 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2025-02-06 10:05:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:05,081 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-02-06 10:05:05,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-02-06 10:05:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:05:05,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:05,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:05,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:05:05,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:05:05,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash -670433228, now seen corresponding path program 1 times [2025-02-06 10:05:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537209699] [2025-02-06 10:05:05,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:05,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:05:05,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:05:05,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:05,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537209699] [2025-02-06 10:05:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537209699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634635313] [2025-02-06 10:05:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:05,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:05,170 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:05,184 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-02-06 10:05:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:05,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-02-06 10:05:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:05,184 INFO L225 Difference]: With dead ends: 32 [2025-02-06 10:05:05,184 INFO L226 Difference]: Without dead ends: 20 [2025-02-06 10:05:05,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:05,185 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 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-06 10:05:05,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-06 10:05:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-06 10:05:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-02-06 10:05:05,187 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2025-02-06 10:05:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:05,188 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-06 10:05:05,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-02-06 10:05:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:05:05,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:05,189 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:05,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:05:05,189 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-06 10:05:05,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1442890186, now seen corresponding path program 1 times [2025-02-06 10:05:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:05,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213825320] [2025-02-06 10:05:05,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:05,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:05:05,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:05:05,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:05,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:05,411 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-06 10:05:05,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213825320] [2025-02-06 10:05:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213825320] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049882167] [2025-02-06 10:05:05,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:05,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:05,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:05,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:05,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:05:05,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:05:05,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:05:05,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:05,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:05,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:05:05,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:05,568 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-06 10:05:05,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:05,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:05:05,719 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-06 10:05:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049882167] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:05,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-02-06 10:05:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79670777] [2025-02-06 10:05:05,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:05,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:05:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:05,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:05:05,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:05:05,721 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:05,860 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-02-06 10:05:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:05:05,861 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:05:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:05,861 INFO L225 Difference]: With dead ends: 25 [2025-02-06 10:05:05,861 INFO L226 Difference]: Without dead ends: 25 [2025-02-06 10:05:05,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:05:05,862 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:05,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-06 10:05:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-02-06 10:05:05,865 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-06 10:05:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-02-06 10:05:05,865 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2025-02-06 10:05:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:05,866 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-02-06 10:05:05,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-02-06 10:05:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:05:05,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:05,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:05,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:05:06,066 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-06 10:05:06,067 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-06 10:05:06,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1779922857, now seen corresponding path program 1 times [2025-02-06 10:05:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533145000] [2025-02-06 10:05:06,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:05:06,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:05:06,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,382 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-06 10:05:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:06,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533145000] [2025-02-06 10:05:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533145000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754986895] [2025-02-06 10:05:06,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:06,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:06,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:06,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:05:06,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:05:06,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:05:06,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 10:05:06,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:06,528 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-06 10:05:06,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:06,534 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-06 10:05:06,834 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-06 10:05:06,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:07,055 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754986895] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:07,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:07,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-02-06 10:05:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807808726] [2025-02-06 10:05:07,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:07,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:05:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:07,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:05:07,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:05:07,097 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:07,259 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-02-06 10:05:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:05:07,259 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:05:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:07,260 INFO L225 Difference]: With dead ends: 26 [2025-02-06 10:05:07,261 INFO L226 Difference]: Without dead ends: 26 [2025-02-06 10:05:07,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:05:07,261 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:07,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-06 10:05:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-02-06 10:05:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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-06 10:05:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-02-06 10:05:07,265 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2025-02-06 10:05:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:07,265 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-02-06 10:05:07,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-02-06 10:05:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:05:07,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:07,266 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:07,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:07,466 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-06 10:05:07,467 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-06 10:05:07,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:07,468 INFO L85 PathProgramCache]: Analyzing trace with hash -15648847, now seen corresponding path program 2 times [2025-02-06 10:05:07,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:07,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798009196] [2025-02-06 10:05:07,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:07,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:07,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-06 10:05:07,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:05:07,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:07,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:07,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:07,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798009196] [2025-02-06 10:05:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798009196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:07,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071654964] [2025-02-06 10:05:07,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:07,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:07,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:07,759 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:07,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:05:07,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-06 10:05:07,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:05:07,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:07,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:07,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 10:05:07,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:07,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:07,952 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-06 10:05:07,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:07,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:07,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:08,018 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-06 10:05:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071654964] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:08,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:08,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2025-02-06 10:05:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789037556] [2025-02-06 10:05:08,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:05:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:08,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:05:08,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:05:08,023 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:08,226 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2025-02-06 10:05:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:05:08,227 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:05:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:08,227 INFO L225 Difference]: With dead ends: 39 [2025-02-06 10:05:08,227 INFO L226 Difference]: Without dead ends: 29 [2025-02-06 10:05:08,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:05:08,228 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:08,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 101 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-06 10:05:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-06 10:05:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-02-06 10:05:08,230 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2025-02-06 10:05:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:08,231 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-02-06 10:05:08,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-02-06 10:05:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:05:08,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:08,231 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:08,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:08,432 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-06 10:05:08,432 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-06 10:05:08,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash -989763512, now seen corresponding path program 3 times [2025-02-06 10:05:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6006638] [2025-02-06 10:05:08,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:08,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-02-06 10:05:08,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:05:08,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:05:08,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:08,685 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-06 10:05:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6006638] [2025-02-06 10:05:08,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6006638] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:08,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500149430] [2025-02-06 10:05:08,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:08,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:08,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:08,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:08,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:05:08,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-02-06 10:05:08,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:05:08,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:05:08,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:08,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 10:05:08,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:08,913 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-06 10:05:08,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:09,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-06 10:05:09,144 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-06 10:05:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500149430] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:09,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-02-06 10:05:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816286926] [2025-02-06 10:05:09,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:09,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:05:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:09,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:05:09,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:05:09,147 INFO L87 Difference]: Start difference. First operand 27 states and 28 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-06 10:05:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:09,334 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-02-06 10:05:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:05:09,336 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 24 [2025-02-06 10:05:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:09,336 INFO L225 Difference]: With dead ends: 30 [2025-02-06 10:05:09,336 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 10:05:09,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:05:09,337 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:09,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 81 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 10:05:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-06 10:05:09,339 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-06 10:05:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-06 10:05:09,339 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2025-02-06 10:05:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:09,339 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-06 10:05:09,339 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-06 10:05:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-06 10:05:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:05:09,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:09,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:09,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:09,540 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-06 10:05:09,541 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-06 10:05:09,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -617897851, now seen corresponding path program 2 times [2025-02-06 10:05:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888775743] [2025-02-06 10:05:09,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:09,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 10:05:09,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:05:09,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:09,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:09,861 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-06 10:05:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888775743] [2025-02-06 10:05:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888775743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041358785] [2025-02-06 10:05:09,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:09,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:09,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:09,870 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:09,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:05:09,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 10:05:09,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:05:09,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:09,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:09,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-06 10:05:09,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:09,982 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-06 10:05:09,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:09,990 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-06 10:05:10,362 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-06 10:05:10,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:10,635 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:10,667 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-06 10:05:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041358785] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:10,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2025-02-06 10:05:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555954773] [2025-02-06 10:05:10,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:10,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:05:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:10,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:05:10,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:05:10,668 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:10,981 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-02-06 10:05:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:05:10,982 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 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 25 [2025-02-06 10:05:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:10,982 INFO L225 Difference]: With dead ends: 36 [2025-02-06 10:05:10,982 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 10:05:10,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 10:05:10,983 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:10,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 83 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 10:05:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-02-06 10:05:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-02-06 10:05:10,984 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2025-02-06 10:05:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:10,984 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-02-06 10:05:10,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-02-06 10:05:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:05:10,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:10,987 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:10,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:05:11,191 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-06 10:05:11,191 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-06 10:05:11,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 434899139, now seen corresponding path program 4 times [2025-02-06 10:05:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525103408] [2025-02-06 10:05:11,192 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:11,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 10:05:11,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-02-06 10:05:11,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:11,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:05:12,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525103408] [2025-02-06 10:05:12,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525103408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236632937] [2025-02-06 10:05:12,034 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:12,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:12,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:12,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:05:12,091 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 10:05:12,108 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-02-06 10:05:12,109 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:12,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:12,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 10:05:12,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:12,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:05:12,828 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-06 10:05:12,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2025-02-06 10:05:12,892 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-06 10:05:12,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:13,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-06 10:05:13,401 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-06 10:05:13,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:05:13,422 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-06 10:05:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236632937] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:13,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2025-02-06 10:05:13,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369830163] [2025-02-06 10:05:13,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:13,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:05:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:13,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:05:13,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:05:13,425 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 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-06 10:05:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:13,738 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-02-06 10:05:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:05:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 10:05:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:13,739 INFO L225 Difference]: With dead ends: 30 [2025-02-06 10:05:13,739 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 10:05:13,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 10:05:13,740 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:13,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 70 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 10:05:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-06 10:05:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) 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-06 10:05:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-06 10:05:13,744 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2025-02-06 10:05:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:13,744 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-06 10:05:13,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 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-06 10:05:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-06 10:05:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:05:13,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:13,745 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:13,751 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-06 10:05:13,945 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-06 10:05:13,946 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-06 10:05:13,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:13,946 INFO L85 PathProgramCache]: Analyzing trace with hash 596971370, now seen corresponding path program 3 times [2025-02-06 10:05:13,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:13,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922735549] [2025-02-06 10:05:13,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:13,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-02-06 10:05:13,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:05:13,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:05:13,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:14,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922735549] [2025-02-06 10:05:14,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922735549] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:14,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012615206] [2025-02-06 10:05:14,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:14,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:14,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:14,226 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:14,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:05:14,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-02-06 10:05:14,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:05:14,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:05:14,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:14,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 10:05:14,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:14,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:14,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:05:14,458 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-06 10:05:14,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:14,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:14,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:14,601 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-06 10:05:14,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012615206] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:14,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:14,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 30 [2025-02-06 10:05:14,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133935686] [2025-02-06 10:05:14,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:14,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:05:14,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:14,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:05:14,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:05:14,602 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:14,935 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-02-06 10:05:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:05:14,936 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 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 29 [2025-02-06 10:05:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:14,936 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:05:14,936 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 10:05:14,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1708, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:05:14,937 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:14,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 10:05:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-02-06 10:05:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-02-06 10:05:14,940 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2025-02-06 10:05:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:14,940 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-02-06 10:05:14,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-02-06 10:05:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:05:14,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:14,940 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:14,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:15,141 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-06 10:05:15,144 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-06 10:05:15,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1119009025, now seen corresponding path program 4 times [2025-02-06 10:05:15,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:15,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266404299] [2025-02-06 10:05:15,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:15,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:15,158 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 10:05:15,180 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:05:15,180 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:05:15,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266404299] [2025-02-06 10:05:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266404299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027327717] [2025-02-06 10:05:15,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:15,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:15,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:15,586 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:15,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:05:15,634 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 10:05:15,660 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:05:15,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:05:15,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:15,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-06 10:05:15,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:15,701 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-06 10:05:15,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:15,705 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-06 10:05:16,159 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-06 10:05:16,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:16,557 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:16,595 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-06 10:05:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027327717] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:16,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:16,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2025-02-06 10:05:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392410320] [2025-02-06 10:05:16,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:05:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:16,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:05:16,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:05:16,596 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:16,937 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-02-06 10:05:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:05:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:05:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:16,938 INFO L225 Difference]: With dead ends: 37 [2025-02-06 10:05:16,938 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 10:05:16,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=1758, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 10:05:16,939 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:16,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 10:05:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 10:05:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-02-06 10:05:16,940 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2025-02-06 10:05:16,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:16,940 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-02-06 10:05:16,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-02-06 10:05:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:05:16,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:16,940 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:16,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:17,141 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-06 10:05:17,141 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-06 10:05:17,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash -928806426, now seen corresponding path program 5 times [2025-02-06 10:05:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098737424] [2025-02-06 10:05:17,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:17,148 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-02-06 10:05:17,161 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:05:17,162 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 10:05:17,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098737424] [2025-02-06 10:05:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098737424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:17,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028715302] [2025-02-06 10:05:17,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:17,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:17,541 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:17,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:05:17,601 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-02-06 10:05:17,642 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:05:17,642 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 10:05:17,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:17,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 10:05:17,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:17,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:17,888 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-06 10:05:17,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:17,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:17,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:17,998 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-06 10:05:17,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028715302] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:17,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:17,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 32 [2025-02-06 10:05:17,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110468752] [2025-02-06 10:05:17,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:05:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:17,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:05:17,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:05:17,999 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:18,536 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2025-02-06 10:05:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:05:18,537 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-06 10:05:18,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:18,537 INFO L225 Difference]: With dead ends: 60 [2025-02-06 10:05:18,537 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:05:18,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=2241, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:05:18,538 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:18,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 161 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:05:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-02-06 10:05:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-02-06 10:05:18,542 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2025-02-06 10:05:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:18,542 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-02-06 10:05:18,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-02-06 10:05:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:05:18,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:18,542 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:18,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 10:05:18,743 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-06 10:05:18,743 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-06 10:05:18,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash -883476369, now seen corresponding path program 6 times [2025-02-06 10:05:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:18,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462648133] [2025-02-06 10:05:18,748 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:05:18,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:18,755 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 5 equivalence classes. [2025-02-06 10:05:18,767 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:05:18,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:05:18,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:19,141 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-06 10:05:19,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:19,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462648133] [2025-02-06 10:05:19,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462648133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:19,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330554046] [2025-02-06 10:05:19,141 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:05:19,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:19,146 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:19,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:05:19,204 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 5 equivalence classes. [2025-02-06 10:05:19,250 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:05:19,250 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:05:19,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:19,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-06 10:05:19,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:19,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:05:19,288 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-06 10:05:19,785 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-06 10:05:19,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:20,271 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-06 10:05:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330554046] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:20,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-02-06 10:05:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41925936] [2025-02-06 10:05:20,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:20,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-06 10:05:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:20,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 10:05:20,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1648, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 10:05:20,273 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:20,852 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2025-02-06 10:05:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:05:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 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 39 [2025-02-06 10:05:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:20,853 INFO L225 Difference]: With dead ends: 45 [2025-02-06 10:05:20,853 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 10:05:20,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=2580, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 10:05:20,854 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:20,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:05:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 10:05:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-02-06 10:05:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2025-02-06 10:05:20,855 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 39 [2025-02-06 10:05:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:20,855 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2025-02-06 10:05:20,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2025-02-06 10:05:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:05:20,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:20,856 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:20,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:21,060 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-06 10:05:21,060 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-06 10:05:21,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:21,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1660854868, now seen corresponding path program 7 times [2025-02-06 10:05:21,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:21,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657468893] [2025-02-06 10:05:21,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:05:21,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:21,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:05:21,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:05:21,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:21,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 41 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657468893] [2025-02-06 10:05:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657468893] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485967582] [2025-02-06 10:05:21,454 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:05:21,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:21,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:21,456 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:21,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:05:21,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:05:21,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:05:21,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:21,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:21,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:05:21,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:21,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:21,830 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-06 10:05:21,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:21,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:21,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:21,922 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-06 10:05:21,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485967582] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:21,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:21,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 35 [2025-02-06 10:05:21,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751458619] [2025-02-06 10:05:21,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:21,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:05:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:21,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:05:21,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:05:21,924 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:22,540 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2025-02-06 10:05:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:05:22,540 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-06 10:05:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:22,541 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:05:22,541 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:05:22,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=2540, Unknown=0, NotChecked=0, Total=2756 [2025-02-06 10:05:22,542 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:22,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 190 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:05:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:05:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-02-06 10:05:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2025-02-06 10:05:22,543 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2025-02-06 10:05:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:22,543 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2025-02-06 10:05:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2025-02-06 10:05:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:05:22,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:22,544 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:22,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:22,744 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-06 10:05:22,744 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-06 10:05:22,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash 619460523, now seen corresponding path program 8 times [2025-02-06 10:05:22,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:22,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796753264] [2025-02-06 10:05:22,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:22,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:22,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:05:22,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:05:22,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:22,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:23,186 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-06 10:05:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796753264] [2025-02-06 10:05:23,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796753264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342340709] [2025-02-06 10:05:23,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:23,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:23,188 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:23,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:05:23,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:05:23,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:05:23,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:23,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:23,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-02-06 10:05:23,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:23,310 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-06 10:05:23,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:23,313 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-06 10:05:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:24,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:24,746 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:24,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342340709] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:24,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:24,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 54 [2025-02-06 10:05:24,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524794595] [2025-02-06 10:05:24,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:24,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 10:05:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:24,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 10:05:24,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2675, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 10:05:24,791 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:25,441 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2025-02-06 10:05:25,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:05:25,442 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 10:05:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:25,442 INFO L225 Difference]: With dead ends: 56 [2025-02-06 10:05:25,442 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:05:25,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=406, Invalid=3754, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 10:05:25,443 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:25,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:05:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:05:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2025-02-06 10:05:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2025-02-06 10:05:25,445 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2025-02-06 10:05:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:25,445 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2025-02-06 10:05:25,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2025-02-06 10:05:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:05:25,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:25,445 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:25,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 10:05:25,650 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-06 10:05:25,650 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-06 10:05:25,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash -548822128, now seen corresponding path program 9 times [2025-02-06 10:05:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084161751] [2025-02-06 10:05:25,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:25,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 7 equivalence classes. [2025-02-06 10:05:25,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:05:25,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 10:05:25,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 61 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084161751] [2025-02-06 10:05:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084161751] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057969682] [2025-02-06 10:05:26,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:26,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:26,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:26,234 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:26,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:05:26,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 7 equivalence classes. [2025-02-06 10:05:26,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:05:26,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 10:05:26,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:26,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-02-06 10:05:26,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:26,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:05:26,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:05:26,939 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-06 10:05:26,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:27,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:27,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:27,434 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-06 10:05:27,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057969682] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:27,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:27,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 57 [2025-02-06 10:05:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912271855] [2025-02-06 10:05:27,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:27,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-06 10:05:27,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:27,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-06 10:05:27,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3013, Unknown=0, NotChecked=0, Total=3192 [2025-02-06 10:05:27,436 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 57 states, 57 states have (on average 2.3859649122807016) internal successors, (136), 57 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:28,679 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2025-02-06 10:05:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:05:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.3859649122807016) internal successors, (136), 57 states have internal predecessors, (136), 0 states have call successors, (0), 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 50 [2025-02-06 10:05:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:28,680 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:05:28,680 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:05:28,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=396, Invalid=6246, Unknown=0, NotChecked=0, Total=6642 [2025-02-06 10:05:28,682 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:28,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:05:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:05:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-02-06 10:05:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2025-02-06 10:05:28,683 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 50 [2025-02-06 10:05:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:28,683 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2025-02-06 10:05:28,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.3859649122807016) internal successors, (136), 57 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2025-02-06 10:05:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:05:28,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:28,683 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:28,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:28,887 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-06 10:05:28,887 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-06 10:05:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash -446648743, now seen corresponding path program 10 times [2025-02-06 10:05:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-02-06 10:05:28,888 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:28,900 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-02-06 10:05:28,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:05:28,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:05:28,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:29,387 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-06 10:05:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-02-06 10:05:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892007589] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984850893] [2025-02-06 10:05:29,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:29,390 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:29,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:05:29,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-02-06 10:05:29,543 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:05:29,543 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:05:29,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:29,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-02-06 10:05:29,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:29,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:05:29,583 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-06 10:05:30,456 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-06 10:05:30,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:31,117 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 51 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984850893] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:31,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:31,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-02-06 10:05:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621425770] [2025-02-06 10:05:31,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:31,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 10:05:31,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:31,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 10:05:31,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2642, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 10:05:31,170 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:31,674 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2025-02-06 10:05:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:05:31,674 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-06 10:05:31,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:31,675 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:05:31,675 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:05:31,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=403, Invalid=3257, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 10:05:31,676 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:31,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:05:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:05:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 10:05:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2025-02-06 10:05:31,678 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2025-02-06 10:05:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:31,678 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2025-02-06 10:05:31,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2025-02-06 10:05:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:05:31,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:31,679 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:31,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:05:31,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:31,883 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-06 10:05:31,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -836299970, now seen corresponding path program 11 times [2025-02-06 10:05:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908823314] [2025-02-06 10:05:31,883 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:31,890 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 8 equivalence classes. [2025-02-06 10:05:31,902 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:05:31,902 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-06 10:05:31,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 85 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:32,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908823314] [2025-02-06 10:05:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908823314] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971440204] [2025-02-06 10:05:32,444 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:32,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:32,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:32,447 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:32,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:05:32,521 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 8 equivalence classes. [2025-02-06 10:05:32,659 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:05:32,659 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-06 10:05:32,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:32,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-06 10:05:32,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:32,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:33,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:05:33,078 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-06 10:05:33,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:33,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:33,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:33,256 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-06 10:05:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971440204] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:33,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:33,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 47 [2025-02-06 10:05:33,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427803617] [2025-02-06 10:05:33,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:33,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 10:05:33,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:33,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 10:05:33,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2020, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 10:05:33,259 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:34,471 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2025-02-06 10:05:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 10:05:34,472 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 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 57 [2025-02-06 10:05:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:34,473 INFO L225 Difference]: With dead ends: 93 [2025-02-06 10:05:34,473 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 10:05:34,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=411, Invalid=5441, Unknown=0, NotChecked=0, Total=5852 [2025-02-06 10:05:34,475 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:34,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 311 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:05:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 10:05:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-02-06 10:05:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2025-02-06 10:05:34,477 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2025-02-06 10:05:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:34,478 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2025-02-06 10:05:34,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2025-02-06 10:05:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 10:05:34,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:34,478 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:34,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:34,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:34,682 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-06 10:05:34,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1807549525, now seen corresponding path program 12 times [2025-02-06 10:05:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851686531] [2025-02-06 10:05:34,682 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:05:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:34,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 8 equivalence classes. [2025-02-06 10:05:34,705 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 10:05:34,705 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 10:05:34,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:35,227 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-06 10:05:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851686531] [2025-02-06 10:05:35,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851686531] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608759193] [2025-02-06 10:05:35,227 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:05:35,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:35,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:35,229 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:35,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:05:35,313 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 8 equivalence classes. [2025-02-06 10:05:35,534 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 10:05:35,534 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 10:05:35,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:35,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-02-06 10:05:35,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:35,565 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-06 10:05:35,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:35,568 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-06 10:05:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 51 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:36,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:36,839 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 70 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608759193] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:36,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:36,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 20] total 63 [2025-02-06 10:05:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376336397] [2025-02-06 10:05:36,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:36,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-06 10:05:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:36,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-06 10:05:36,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=3563, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 10:05:36,883 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:37,685 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2025-02-06 10:05:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:05:37,685 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-06 10:05:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:37,686 INFO L225 Difference]: With dead ends: 65 [2025-02-06 10:05:37,686 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:05:37,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=913, Invalid=6227, Unknown=0, NotChecked=0, Total=7140 [2025-02-06 10:05:37,687 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:37,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 71 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:05:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:05:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 10:05:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-02-06 10:05:37,689 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2025-02-06 10:05:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:37,689 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-02-06 10:05:37,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-02-06 10:05:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 10:05:37,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:37,690 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:37,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:05:37,890 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-06 10:05:37,890 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-06 10:05:37,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2110780614, now seen corresponding path program 13 times [2025-02-06 10:05:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:37,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536432837] [2025-02-06 10:05:37,890 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:05:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:37,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 10:05:37,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 10:05:37,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:37,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 113 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:38,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:38,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536432837] [2025-02-06 10:05:38,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536432837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:38,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019884398] [2025-02-06 10:05:38,527 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:05:38,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:38,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:38,535 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:38,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:05:38,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 10:05:38,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 10:05:38,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:38,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:38,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-02-06 10:05:38,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:38,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:39,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:05:39,208 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-06 10:05:39,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:39,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:39,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:39,364 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-06 10:05:39,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019884398] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:39,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:39,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2025-02-06 10:05:39,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356223739] [2025-02-06 10:05:39,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:39,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 10:05:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:39,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 10:05:39,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 10:05:39,366 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:40,601 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2025-02-06 10:05:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 10:05:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 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 64 [2025-02-06 10:05:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:40,602 INFO L225 Difference]: With dead ends: 104 [2025-02-06 10:05:40,602 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 10:05:40,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=364, Invalid=5186, Unknown=0, NotChecked=0, Total=5550 [2025-02-06 10:05:40,603 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:40,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 365 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:05:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 10:05:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-02-06 10:05:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2025-02-06 10:05:40,604 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 64 [2025-02-06 10:05:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:40,605 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2025-02-06 10:05:40,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2025-02-06 10:05:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 10:05:40,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:40,605 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:40,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:05:40,809 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-06 10:05:40,809 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-06 10:05:40,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1284242877, now seen corresponding path program 14 times [2025-02-06 10:05:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914578614] [2025-02-06 10:05:40,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:40,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-06 10:05:40,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 10:05:40,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:40,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:41,473 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-06 10:05:41,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:41,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914578614] [2025-02-06 10:05:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914578614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:41,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334467082] [2025-02-06 10:05:41,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:41,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:41,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:41,475 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:41,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:05:41,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-06 10:05:41,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 10:05:41,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:41,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:41,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-02-06 10:05:41,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:41,695 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-06 10:05:41,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:41,701 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-06 10:05:42,840 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-06 10:05:42,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:43,778 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:43,822 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-06 10:05:43,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334467082] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:43,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 72 [2025-02-06 10:05:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064937380] [2025-02-06 10:05:43,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:43,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-06 10:05:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:43,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-06 10:05:43,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=4772, Unknown=0, NotChecked=0, Total=5256 [2025-02-06 10:05:43,824 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 73 states, 72 states have (on average 2.763888888888889) internal successors, (199), 73 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:45,085 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-02-06 10:05:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-06 10:05:45,085 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.763888888888889) internal successors, (199), 73 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 10:05:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:45,086 INFO L225 Difference]: With dead ends: 77 [2025-02-06 10:05:45,086 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:05:45,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=691, Invalid=7141, Unknown=0, NotChecked=0, Total=7832 [2025-02-06 10:05:45,087 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:45,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 314 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:05:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:05:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2025-02-06 10:05:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2025-02-06 10:05:45,091 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2025-02-06 10:05:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:45,091 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2025-02-06 10:05:45,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.763888888888889) internal successors, (199), 73 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2025-02-06 10:05:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 10:05:45,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:45,091 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:45,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-06 10:05:45,292 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-06 10:05:45,292 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-06 10:05:45,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash -113614296, now seen corresponding path program 15 times [2025-02-06 10:05:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:45,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114687728] [2025-02-06 10:05:45,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:45,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 10 equivalence classes. [2025-02-06 10:05:45,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:05:45,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 10:05:45,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 145 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:46,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:46,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114687728] [2025-02-06 10:05:46,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114687728] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:46,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136422854] [2025-02-06 10:05:46,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:46,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:46,389 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:46,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:05:46,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 10 equivalence classes. [2025-02-06 10:05:46,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:05:46,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 10:05:46,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:46,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 156 conjuncts are in the unsatisfiable core [2025-02-06 10:05:46,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:47,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:05:47,669 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-06 10:05:47,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:48,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:48,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 16 treesize of output 12 [2025-02-06 10:05:48,569 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-06 10:05:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136422854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:48,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25, 25] total 78 [2025-02-06 10:05:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271707809] [2025-02-06 10:05:48,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:48,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-02-06 10:05:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:48,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-02-06 10:05:48,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=5718, Unknown=0, NotChecked=0, Total=6006 [2025-02-06 10:05:48,571 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 78 states, 78 states have (on average 2.551282051282051) internal successors, (199), 78 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:50,846 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2025-02-06 10:05:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-06 10:05:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.551282051282051) internal successors, (199), 78 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 10:05:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:50,846 INFO L225 Difference]: With dead ends: 115 [2025-02-06 10:05:50,846 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:05:50,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2829 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=681, Invalid=12429, Unknown=0, NotChecked=0, Total=13110 [2025-02-06 10:05:50,848 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:50,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 495 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:05:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:05:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2025-02-06 10:05:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2025-02-06 10:05:50,849 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2025-02-06 10:05:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:50,849 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2025-02-06 10:05:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.551282051282051) internal successors, (199), 78 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2025-02-06 10:05:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 10:05:50,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:50,849 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:50,860 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-06 10:05:51,050 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-06 10:05:51,050 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-06 10:05:51,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1338842879, now seen corresponding path program 16 times [2025-02-06 10:05:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:51,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267525811] [2025-02-06 10:05:51,051 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:51,059 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-02-06 10:05:51,074 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 10:05:51,075 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:05:51,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:51,810 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-06 10:05:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267525811] [2025-02-06 10:05:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267525811] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823742921] [2025-02-06 10:05:51,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:51,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:51,813 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:51,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:05:51,903 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-02-06 10:05:52,373 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 10:05:52,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:05:52,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:52,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 161 conjuncts are in the unsatisfiable core [2025-02-06 10:05:52,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:52,437 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-06 10:05:52,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:52,441 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-06 10:05:53,648 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-06 10:05:53,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:54,835 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:54,890 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-06 10:05:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823742921] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:54,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:54,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 72 [2025-02-06 10:05:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081286154] [2025-02-06 10:05:54,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:54,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-06 10:05:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:54,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-06 10:05:54,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=4685, Unknown=0, NotChecked=0, Total=5256 [2025-02-06 10:05:54,893 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 73 states, 72 states have (on average 3.0555555555555554) internal successors, (220), 73 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:55,873 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2025-02-06 10:05:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 10:05:55,874 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 3.0555555555555554) internal successors, (220), 73 states have internal predecessors, (220), 0 states have call successors, (0), 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 74 [2025-02-06 10:05:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:55,874 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:05:55,875 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:05:55,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=697, Invalid=5945, Unknown=0, NotChecked=0, Total=6642 [2025-02-06 10:05:55,875 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:55,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 257 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:05:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:05:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-06 10:05:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2025-02-06 10:05:55,878 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2025-02-06 10:05:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:55,878 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2025-02-06 10:05:55,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 3.0555555555555554) internal successors, (220), 73 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2025-02-06 10:05:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 10:05:55,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:55,878 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:55,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:56,078 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-06 10:05:56,079 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-06 10:05:56,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1442758884, now seen corresponding path program 17 times [2025-02-06 10:05:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294177111] [2025-02-06 10:05:56,079 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:56,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:56,089 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 11 equivalence classes. [2025-02-06 10:05:56,107 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 10:05:56,107 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 10:05:56,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 167 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294177111] [2025-02-06 10:05:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294177111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582015593] [2025-02-06 10:05:56,946 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:56,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:56,948 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:56,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 10:05:57,055 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 11 equivalence classes. [2025-02-06 10:05:58,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 10:05:58,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 10:05:58,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:58,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-02-06 10:05:58,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:58,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:58,802 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-06 10:05:58,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:58,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:58,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:58,959 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-06 10:05:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582015593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:58,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:58,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 27] total 57 [2025-02-06 10:05:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610430771] [2025-02-06 10:05:58,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:58,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-06 10:05:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:58,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-06 10:05:58,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3018, Unknown=0, NotChecked=0, Total=3192 [2025-02-06 10:05:58,961 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 57 states, 57 states have (on average 2.719298245614035) internal successors, (155), 57 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:01,032 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2025-02-06 10:06:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 10:06:01,032 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.719298245614035) internal successors, (155), 57 states have internal predecessors, (155), 0 states have call successors, (0), 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 78 [2025-02-06 10:06:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:01,034 INFO L225 Difference]: With dead ends: 126 [2025-02-06 10:06:01,034 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 10:06:01,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=610, Invalid=9092, Unknown=0, NotChecked=0, Total=9702 [2025-02-06 10:06:01,035 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:01,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 508 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:06:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 10:06:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-02-06 10:06:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 81 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2025-02-06 10:06:01,037 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2025-02-06 10:06:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:01,037 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2025-02-06 10:06:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.719298245614035) internal successors, (155), 57 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2025-02-06 10:06:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 10:06:01,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:01,037 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:01,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-02-06 10:06:01,237 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-06 10:06:01,238 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-06 10:06:01,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1916613677, now seen corresponding path program 18 times [2025-02-06 10:06:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939756607] [2025-02-06 10:06:01,238 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:06:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:01,252 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 81 statements into 11 equivalence classes. [2025-02-06 10:06:01,285 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 10:06:01,285 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 10:06:01,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:02,084 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-06 10:06:02,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939756607] [2025-02-06 10:06:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939756607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685886801] [2025-02-06 10:06:02,084 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:06:02,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:02,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:02,087 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:02,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-06 10:06:02,184 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 81 statements into 11 equivalence classes. [2025-02-06 10:06:03,324 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 10:06:03,324 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 10:06:03,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:03,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 173 conjuncts are in the unsatisfiable core [2025-02-06 10:06:03,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:03,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:06:03,372 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-06 10:06:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 117 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:04,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 145 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:05,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685886801] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:05,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:05,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 81 [2025-02-06 10:06:05,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740493247] [2025-02-06 10:06:05,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:05,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2025-02-06 10:06:05,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:05,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2025-02-06 10:06:05,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=5909, Unknown=0, NotChecked=0, Total=6642 [2025-02-06 10:06:05,869 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 82 states, 81 states have (on average 2.9753086419753085) internal successors, (241), 82 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:07,013 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2025-02-06 10:06:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 10:06:07,014 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 2.9753086419753085) internal successors, (241), 82 states have internal predecessors, (241), 0 states have call successors, (0), 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 81 [2025-02-06 10:06:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:07,014 INFO L225 Difference]: With dead ends: 86 [2025-02-06 10:06:07,014 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 10:06:07,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3449 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1200, Invalid=9512, Unknown=0, NotChecked=0, Total=10712 [2025-02-06 10:06:07,016 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:07,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:06:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 10:06:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 10:06:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2025-02-06 10:06:07,018 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 81 [2025-02-06 10:06:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:07,018 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2025-02-06 10:06:07,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 2.9753086419753085) internal successors, (241), 82 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2025-02-06 10:06:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 10:06:07,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:07,019 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:07,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-06 10:06:07,224 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-06 10:06:07,224 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-06 10:06:07,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash -354119918, now seen corresponding path program 19 times [2025-02-06 10:06:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023900322] [2025-02-06 10:06:07,224 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:06:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:07,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 10:06:07,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 10:06:07,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:07,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 221 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:08,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:08,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023900322] [2025-02-06 10:06:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023900322] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:08,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196529790] [2025-02-06 10:06:08,206 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:06:08,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:08,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:08,209 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:08,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-06 10:06:08,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 10:06:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 10:06:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:08,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-02-06 10:06:08,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:08,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:06:09,220 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-06 10:06:09,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:09,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:06:09,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:06:09,382 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-06 10:06:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196529790] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:09,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 59 [2025-02-06 10:06:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143451451] [2025-02-06 10:06:09,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:09,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-02-06 10:06:09,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:09,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-02-06 10:06:09,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3239, Unknown=0, NotChecked=0, Total=3422 [2025-02-06 10:06:09,383 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 59 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:11,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:11,123 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2025-02-06 10:06:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-06 10:06:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 59 states have internal predecessors, (169), 0 states have call successors, (0), 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 85 [2025-02-06 10:06:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:11,124 INFO L225 Difference]: With dead ends: 137 [2025-02-06 10:06:11,124 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 10:06:11,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=540, Invalid=8390, Unknown=0, NotChecked=0, Total=8930 [2025-02-06 10:06:11,125 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:11,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 568 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 10:06:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 10:06:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-02-06 10:06:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2025-02-06 10:06:11,126 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2025-02-06 10:06:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:11,126 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2025-02-06 10:06:11,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 59 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2025-02-06 10:06:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 10:06:11,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:11,127 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:11,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-02-06 10:06:11,331 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-06 10:06:11,331 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-06 10:06:11,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash -213612631, now seen corresponding path program 20 times [2025-02-06 10:06:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:11,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502855852] [2025-02-06 10:06:11,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:11,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-02-06 10:06:11,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:06:11,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:11,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:12,322 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-06 10:06:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502855852] [2025-02-06 10:06:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502855852] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9643693] [2025-02-06 10:06:12,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:12,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:12,324 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:12,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-06 10:06:12,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-02-06 10:06:12,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:06:12,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:12,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:12,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 201 conjuncts are in the unsatisfiable core [2025-02-06 10:06:12,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:12,533 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-06 10:06:12,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:12,536 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-06 10:06:14,411 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-06 10:06:14,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:16,060 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:06:16,122 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-06 10:06:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9643693] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:16,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:16,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 90 [2025-02-06 10:06:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559690402] [2025-02-06 10:06:16,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:16,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-02-06 10:06:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:16,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-02-06 10:06:16,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=7463, Unknown=0, NotChecked=0, Total=8190 [2025-02-06 10:06:16,123 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 91 states, 90 states have (on average 2.911111111111111) internal successors, (262), 91 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:18,197 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2025-02-06 10:06:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-06 10:06:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 2.911111111111111) internal successors, (262), 91 states have internal predecessors, (262), 0 states have call successors, (0), 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 88 [2025-02-06 10:06:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:18,198 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:06:18,198 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:06:18,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3719 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1057, Invalid=11599, Unknown=0, NotChecked=0, Total=12656 [2025-02-06 10:06:18,199 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:18,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 462 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 10:06:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:06:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2025-02-06 10:06:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2025-02-06 10:06:18,201 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 88 [2025-02-06 10:06:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:18,201 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2025-02-06 10:06:18,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 2.911111111111111) internal successors, (262), 91 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2025-02-06 10:06:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 10:06:18,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:18,202 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:18,209 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-06 10:06:18,402 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-06 10:06:18,403 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-06 10:06:18,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash 685622414, now seen corresponding path program 21 times [2025-02-06 10:06:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354144088] [2025-02-06 10:06:18,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:18,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 13 equivalence classes. [2025-02-06 10:06:18,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 10:06:18,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-06 10:06:18,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 265 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:19,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:19,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354144088] [2025-02-06 10:06:19,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354144088] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:19,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219360399] [2025-02-06 10:06:19,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:19,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:19,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:19,676 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:19,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-02-06 10:06:19,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 13 equivalence classes. [2025-02-06 10:06:22,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 10:06:22,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-06 10:06:22,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:22,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 203 conjuncts are in the unsatisfiable core [2025-02-06 10:06:22,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:22,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:06:23,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:06:23,408 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-06 10:06:23,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:24,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:06:24,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:06:24,800 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-06 10:06:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219360399] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:24,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:24,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 31, 31] total 98 [2025-02-06 10:06:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440057090] [2025-02-06 10:06:24,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:24,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-02-06 10:06:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:24,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-02-06 10:06:24,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=9098, Unknown=0, NotChecked=0, Total=9506 [2025-02-06 10:06:24,802 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 98 states, 98 states have (on average 2.673469387755102) internal successors, (262), 98 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:28,596 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2025-02-06 10:06:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-06 10:06:28,597 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.673469387755102) internal successors, (262), 98 states have internal predecessors, (262), 0 states have call successors, (0), 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 92 [2025-02-06 10:06:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:28,598 INFO L225 Difference]: With dead ends: 148 [2025-02-06 10:06:28,598 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:06:28,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1000, Invalid=20170, Unknown=0, NotChecked=0, Total=21170 [2025-02-06 10:06:28,605 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 4212 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 4245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:28,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 794 Invalid, 4245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4212 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 10:06:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:06:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-02-06 10:06:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2025-02-06 10:06:28,606 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2025-02-06 10:06:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:28,606 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2025-02-06 10:06:28,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.673469387755102) internal successors, (262), 98 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2025-02-06 10:06:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 10:06:28,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:28,609 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:28,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-02-06 10:06:28,809 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-06 10:06:28,810 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-06 10:06:28,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash 820528151, now seen corresponding path program 22 times [2025-02-06 10:06:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:28,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101833060] [2025-02-06 10:06:28,810 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:06:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:28,827 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-02-06 10:06:28,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 10:06:28,865 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:06:28,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:30,691 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-06 10:06:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101833060] [2025-02-06 10:06:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101833060] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869316191] [2025-02-06 10:06:30,692 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:06:30,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:30,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:30,694 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:30,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-02-06 10:06:30,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-02-06 10:06:31,752 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 10:06:31,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:06:31,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:31,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 226 conjuncts are in the unsatisfiable core [2025-02-06 10:06:31,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:31,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:06:31,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:31,841 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-06 10:06:31,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:06:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:33,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:35,941 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:06:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:36,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869316191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:36,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:36,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 32] total 96 [2025-02-06 10:06:36,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154192009] [2025-02-06 10:06:36,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:36,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-02-06 10:06:36,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:36,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-02-06 10:06:36,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=8683, Unknown=0, NotChecked=0, Total=9312 [2025-02-06 10:06:36,014 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 97 states, 96 states have (on average 2.9479166666666665) internal successors, (283), 97 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)