./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8697c629a22dee8b5a51c26261db89d3e1115a5e0c1bc03fd54c09ffc3b9b0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:07:33,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:07:33,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:07:33,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:07:33,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:07:33,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:07:33,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:07:33,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:07:33,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:07:33,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:07:33,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:07:33,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:07:33,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:07:33,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:07:33,668 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:07:33,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:07:33,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:07:33,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:07:33,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:07:33,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:07:33,668 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:07:33,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:07:33,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:07:33,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:07:33,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:07:33,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:07:33,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:07:33,671 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 -> d8697c629a22dee8b5a51c26261db89d3e1115a5e0c1bc03fd54c09ffc3b9b0d [2025-01-09 22:07:33,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:07:33,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:07:33,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:07:33,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:07:33,897 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:07:33,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2025-01-09 22:07:35,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1a5ac4ad/4d1334abc2b2422d86a80ba7f17a729b/FLAG4c03cb857 [2025-01-09 22:07:35,410 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:07:35,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2025-01-09 22:07:35,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1a5ac4ad/4d1334abc2b2422d86a80ba7f17a729b/FLAG4c03cb857 [2025-01-09 22:07:35,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1a5ac4ad/4d1334abc2b2422d86a80ba7f17a729b [2025-01-09 22:07:35,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:07:35,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:07:35,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:07:35,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:07:35,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:07:35,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275adb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35, skipping insertion in model container [2025-01-09 22:07:35,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:07:35,873 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:07:35,875 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:07:35,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:07:35,887 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:07:35,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:07:35,937 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:07:35,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35 WrapperNode [2025-01-09 22:07:35,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:07:35,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:07:35,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:07:35,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:07:35,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,959 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2025-01-09 22:07:35,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:07:35,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:07:35,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:07:35,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:07:35,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,977 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [6, 3]. 67 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 6 writes are split as follows [4, 2]. [2025-01-09 22:07:35,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:07:35,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:07:35,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:07:35,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:07:35,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (1/1) ... [2025-01-09 22:07:35,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:07:35,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:36,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:07:36,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:07:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:07:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:07:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:07:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:07:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:07:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:07:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:07:36,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:07:36,111 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:07:36,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:07:36,276 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-09 22:07:36,276 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:07:36,283 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:07:36,283 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:07:36,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:36 BoogieIcfgContainer [2025-01-09 22:07:36,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:07:36,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:07:36,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:07:36,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:07:36,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:07:35" (1/3) ... [2025-01-09 22:07:36,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5314b36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:36, skipping insertion in model container [2025-01-09 22:07:36,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:35" (2/3) ... [2025-01-09 22:07:36,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5314b36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:36, skipping insertion in model container [2025-01-09 22:07:36,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:36" (3/3) ... [2025-01-09 22:07:36,290 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca-2.i [2025-01-09 22:07:36,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:07:36,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrncat-alloca-2.i that has 1 procedures, 52 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-01-09 22:07:36,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:07:36,330 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;@78a7bdf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:07:36,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-09 22:07:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.96875) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:07:36,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:36,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:36,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:36,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031104, now seen corresponding path program 1 times [2025-01-09 22:07:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599070949] [2025-01-09 22:07:36,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:36,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:07:36,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:07:36,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:36,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:36,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:36,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599070949] [2025-01-09 22:07:36,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599070949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:36,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:36,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:07:36,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836343694] [2025-01-09 22:07:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:36,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:07:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:36,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:07:36,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:36,464 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.96875) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 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 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-01-09 22:07:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:36,511 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-01-09 22:07:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:07:36,513 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-01-09 22:07:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:36,517 INFO L225 Difference]: With dead ends: 53 [2025-01-09 22:07:36,517 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 22:07:36,518 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-01-09 22:07:36,520 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:36,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 89 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 22:07:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 22:07:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 49 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-01-09 22:07:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-09 22:07:36,547 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 7 [2025-01-09 22:07:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:36,547 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-09 22:07:36,547 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-01-09 22:07:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-01-09 22:07:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:07:36,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:36,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:36,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:07:36,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:36,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 121388788, now seen corresponding path program 1 times [2025-01-09 22:07:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:36,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33681709] [2025-01-09 22:07:36,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:36,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:07:36,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:07:36,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:36,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:36,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:36,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33681709] [2025-01-09 22:07:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33681709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:36,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:36,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:07:36,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000378246] [2025-01-09 22:07:36,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:36,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:07:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:36,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:07:36,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:07:36,676 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:36,747 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-01-09 22:07:36,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:07:36,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-01-09 22:07:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:36,748 INFO L225 Difference]: With dead ends: 53 [2025-01-09 22:07:36,748 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 22:07:36,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:07:36,749 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 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-01-09 22:07:36,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 22:07:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 22:07:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-01-09 22:07:36,755 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 8 [2025-01-09 22:07:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:36,755 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-01-09 22:07:36,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-01-09 22:07:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:07:36,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:36,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:36,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:07:36,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:36,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash 178647090, now seen corresponding path program 1 times [2025-01-09 22:07:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528131308] [2025-01-09 22:07:36,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:36,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:07:36,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:07:36,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:36,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:37,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528131308] [2025-01-09 22:07:37,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528131308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:37,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:37,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:07:37,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949067007] [2025-01-09 22:07:37,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:37,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:07:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:37,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:07:37,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:37,032 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:37,145 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-01-09 22:07:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:07:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-01-09 22:07:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:37,147 INFO L225 Difference]: With dead ends: 53 [2025-01-09 22:07:37,147 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 22:07:37,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:07:37,147 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 23 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:37,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 177 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 22:07:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-01-09 22:07:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-01-09 22:07:37,151 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 8 [2025-01-09 22:07:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:37,151 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-01-09 22:07:37,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-01-09 22:07:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:07:37,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:37,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:37,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:07:37,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:37,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:37,152 INFO L85 PathProgramCache]: Analyzing trace with hash 178647089, now seen corresponding path program 1 times [2025-01-09 22:07:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:37,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555686779] [2025-01-09 22:07:37,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:37,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:07:37,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:07:37,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:37,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:37,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:37,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555686779] [2025-01-09 22:07:37,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555686779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:37,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:37,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:07:37,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756026104] [2025-01-09 22:07:37,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:37,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:07:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:37,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:07:37,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:37,211 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:37,240 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-01-09 22:07:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:07:37,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-01-09 22:07:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:37,241 INFO L225 Difference]: With dead ends: 50 [2025-01-09 22:07:37,241 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 22:07:37,242 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-01-09 22:07:37,242 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:37,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 69 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 22:07:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 22:07:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 49 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-01-09 22:07:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-09 22:07:37,245 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 8 [2025-01-09 22:07:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:37,245 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-09 22:07:37,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-01-09 22:07:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:07:37,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:37,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:37,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:07:37,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:37,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1243098518, now seen corresponding path program 1 times [2025-01-09 22:07:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159461622] [2025-01-09 22:07:37,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:37,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:37,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:07:37,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:07:37,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:37,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:37,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159461622] [2025-01-09 22:07:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159461622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:07:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122197353] [2025-01-09 22:07:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:37,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:07:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:37,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:07:37,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:37,281 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:37,295 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-01-09 22:07:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:07:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:07:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:37,296 INFO L225 Difference]: With dead ends: 63 [2025-01-09 22:07:37,296 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 22:07:37,296 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-01-09 22:07:37,297 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:37,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 107 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 22:07:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2025-01-09 22:07:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-01-09 22:07:37,300 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 9 [2025-01-09 22:07:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:37,300 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-01-09 22:07:37,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-01-09 22:07:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:07:37,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:37,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:37,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:07:37,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:37,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1243098711, now seen corresponding path program 1 times [2025-01-09 22:07:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:37,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642468019] [2025-01-09 22:07:37,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:37,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:07:37,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:07:37,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:37,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:37,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642468019] [2025-01-09 22:07:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642468019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:37,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:37,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:07:37,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109331709] [2025-01-09 22:07:37,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:37,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:07:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:37,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:07:37,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:37,530 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:37,657 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2025-01-09 22:07:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:07:37,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:07:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:37,658 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:07:37,659 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:07:37,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:07:37,659 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 48 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:37,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 142 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:07:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2025-01-09 22:07:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.68) internal successors, (84), 66 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2025-01-09 22:07:37,663 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 9 [2025-01-09 22:07:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:37,663 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2025-01-09 22:07:37,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2025-01-09 22:07:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:07:37,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:37,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:37,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:07:37,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:37,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:37,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1244945753, now seen corresponding path program 1 times [2025-01-09 22:07:37,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:37,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721452723] [2025-01-09 22:07:37,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:37,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:37,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:07:37,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:07:37,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:37,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:37,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721452723] [2025-01-09 22:07:37,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721452723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:37,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:37,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:07:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595583] [2025-01-09 22:07:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:37,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:07:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:37,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:07:37,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:37,788 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:37,828 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2025-01-09 22:07:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:07:37,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:07:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:37,829 INFO L225 Difference]: With dead ends: 66 [2025-01-09 22:07:37,829 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 22:07:37,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:07:37,830 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:37,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 112 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 22:07:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2025-01-09 22:07:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 56 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-01-09 22:07:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-01-09 22:07:37,832 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 9 [2025-01-09 22:07:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:37,832 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-01-09 22:07:37,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-01-09 22:07:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:07:37,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:37,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:37,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:07:37,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:37,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:37,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1300356820, now seen corresponding path program 1 times [2025-01-09 22:07:37,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:37,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129295799] [2025-01-09 22:07:37,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:37,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:37,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:07:37,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:07:37,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:37,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:37,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129295799] [2025-01-09 22:07:37,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129295799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:37,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:37,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:07:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911570518] [2025-01-09 22:07:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:37,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:07:37,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:37,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:07:37,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:37,880 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:37,909 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-01-09 22:07:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:07:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:07:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:37,911 INFO L225 Difference]: With dead ends: 61 [2025-01-09 22:07:37,911 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 22:07:37,911 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-01-09 22:07:37,912 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:37,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 22:07:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-01-09 22:07:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 56 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-01-09 22:07:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-01-09 22:07:37,914 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 9 [2025-01-09 22:07:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:37,914 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-01-09 22:07:37,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-01-09 22:07:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:07:37,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:37,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:07:37,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash -118645635, now seen corresponding path program 1 times [2025-01-09 22:07:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:37,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993139358] [2025-01-09 22:07:37,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:37,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:07:37,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:07:37,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:37,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993139358] [2025-01-09 22:07:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993139358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:37,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:07:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119632377] [2025-01-09 22:07:37,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:37,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:07:37,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:37,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:07:37,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:37,940 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-01-09 22:07:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:37,960 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-01-09 22:07:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:07:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-01-09 22:07:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:37,961 INFO L225 Difference]: With dead ends: 55 [2025-01-09 22:07:37,961 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 22:07:37,961 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-01-09 22:07:37,962 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:37,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 22:07:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 22:07:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-01-09 22:07:37,964 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 10 [2025-01-09 22:07:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:37,964 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-01-09 22:07:37,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-01-09 22:07:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-01-09 22:07:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:07:37,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:37,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:37,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:07:37,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:37,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -118645634, now seen corresponding path program 1 times [2025-01-09 22:07:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:37,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762444772] [2025-01-09 22:07:37,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:37,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:07:37,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:07:37,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:37,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:38,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:38,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762444772] [2025-01-09 22:07:38,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762444772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:38,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:38,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:07:38,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362615778] [2025-01-09 22:07:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:38,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:07:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:38,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:07:38,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:38,030 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:38,069 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-01-09 22:07:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:07:38,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 22:07:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:38,069 INFO L225 Difference]: With dead ends: 59 [2025-01-09 22:07:38,070 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 22:07:38,070 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-01-09 22:07:38,070 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:38,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 118 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 22:07:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-01-09 22:07:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-01-09 22:07:38,073 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 10 [2025-01-09 22:07:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:38,073 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-01-09 22:07:38,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-01-09 22:07:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:07:38,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:38,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:38,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:07:38,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:38,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1656361728, now seen corresponding path program 1 times [2025-01-09 22:07:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:38,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120885999] [2025-01-09 22:07:38,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:38,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:07:38,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:07:38,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:38,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120885999] [2025-01-09 22:07:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120885999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:38,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:07:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476904389] [2025-01-09 22:07:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:38,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:07:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:38,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:07:38,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:07:38,175 INFO L87 Difference]: Start difference. First operand 58 states and 70 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-01-09 22:07:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:38,224 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-01-09 22:07:38,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:07:38,225 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-01-09 22:07:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:38,225 INFO L225 Difference]: With dead ends: 65 [2025-01-09 22:07:38,225 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 22:07:38,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:07:38,226 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:38,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 22:07:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2025-01-09 22:07:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 56 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-01-09 22:07:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-01-09 22:07:38,228 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 10 [2025-01-09 22:07:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:38,228 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-01-09 22:07:38,228 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-01-09 22:07:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-01-09 22:07:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:07:38,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:38,229 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:38,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:07:38,229 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:38,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash 610951508, now seen corresponding path program 1 times [2025-01-09 22:07:38,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:38,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050665832] [2025-01-09 22:07:38,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:38,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:38,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:07:38,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:07:38,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:38,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:38,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050665832] [2025-01-09 22:07:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050665832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480725895] [2025-01-09 22:07:38,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:38,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:38,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:38,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:38,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:07:38,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:07:38,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:07:38,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:38,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:38,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:07:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:38,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:07:38,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:07:38,585 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-01-09 22:07:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:38,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:38,908 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:07:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480725895] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:38,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-09 22:07:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816148351] [2025-01-09 22:07:38,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:38,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:07:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:38,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:07:38,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:07:38,968 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 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-01-09 22:07:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:39,155 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-01-09 22:07:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:07:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 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) Word has length 11 [2025-01-09 22:07:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:39,157 INFO L225 Difference]: With dead ends: 60 [2025-01-09 22:07:39,157 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 22:07:39,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:07:39,157 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 29 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:39,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 376 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 22:07:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-01-09 22:07:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.575) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-01-09 22:07:39,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 11 [2025-01-09 22:07:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:39,160 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-01-09 22:07:39,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 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-01-09 22:07:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-01-09 22:07:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:07:39,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:39,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:39,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:07:39,364 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,SelfDestructingSolverStorable11 [2025-01-09 22:07:39,364 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:39,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:39,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1945662465, now seen corresponding path program 1 times [2025-01-09 22:07:39,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:39,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224393209] [2025-01-09 22:07:39,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:39,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:39,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:07:39,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:07:39,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:39,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:39,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:39,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224393209] [2025-01-09 22:07:39,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224393209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:39,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:39,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:07:39,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965382634] [2025-01-09 22:07:39,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:39,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:07:39,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:39,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:07:39,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:39,397 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:39,430 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-01-09 22:07:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:07:39,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-01-09 22:07:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:39,431 INFO L225 Difference]: With dead ends: 51 [2025-01-09 22:07:39,431 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 22:07:39,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:39,431 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:39,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 22:07:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-01-09 22:07:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.475) internal successors, (59), 48 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-01-09 22:07:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-01-09 22:07:39,433 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 12 [2025-01-09 22:07:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:39,434 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-01-09 22:07:39,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-01-09 22:07:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:07:39,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:39,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:39,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:07:39,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1945662466, now seen corresponding path program 1 times [2025-01-09 22:07:39,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:39,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750246140] [2025-01-09 22:07:39,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:39,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:39,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:07:39,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:07:39,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:39,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:39,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:39,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750246140] [2025-01-09 22:07:39,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750246140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:39,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:39,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:07:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713155401] [2025-01-09 22:07:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:39,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:07:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:39,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:07:39,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:39,520 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:39,711 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-01-09 22:07:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:07:39,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-01-09 22:07:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:39,711 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:07:39,711 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:07:39,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:07:39,712 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:39,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 110 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:07:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:07:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2025-01-09 22:07:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 59 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-01-09 22:07:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2025-01-09 22:07:39,714 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 12 [2025-01-09 22:07:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:39,714 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2025-01-09 22:07:39,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2025-01-09 22:07:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:07:39,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:39,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:39,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:07:39,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:39,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1855275337, now seen corresponding path program 1 times [2025-01-09 22:07:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:39,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250980524] [2025-01-09 22:07:39,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:39,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:39,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:07:39,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:07:39,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:39,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250980524] [2025-01-09 22:07:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250980524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036525700] [2025-01-09 22:07:39,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:39,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:39,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:39,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:07:39,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:07:39,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:07:39,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:39,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:39,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 22:07:39,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:39,958 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-01-09 22:07:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:40,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:40,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036525700] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:40,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:40,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 22:07:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562607586] [2025-01-09 22:07:40,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:40,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:07:40,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:40,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:07:40,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:07:40,133 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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-01-09 22:07:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:40,411 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2025-01-09 22:07:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:07:40,411 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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) Word has length 12 [2025-01-09 22:07:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:40,412 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:07:40,412 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:07:40,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:07:40,413 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:40,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 121 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:07:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:07:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2025-01-09 22:07:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 73 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2025-01-09 22:07:40,414 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 12 [2025-01-09 22:07:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:40,415 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2025-01-09 22:07:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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-01-09 22:07:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2025-01-09 22:07:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:07:40,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:40,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:40,423 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-01-09 22:07:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:07:40,619 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:40,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1678954658, now seen corresponding path program 1 times [2025-01-09 22:07:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432964727] [2025-01-09 22:07:40,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:40,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:07:40,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:07:40,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:40,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:40,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:40,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432964727] [2025-01-09 22:07:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432964727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:40,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:40,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:07:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464032769] [2025-01-09 22:07:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:40,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:07:40,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:40,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:07:40,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:40,718 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:40,745 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2025-01-09 22:07:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:07:40,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:07:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:40,746 INFO L225 Difference]: With dead ends: 81 [2025-01-09 22:07:40,746 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 22:07:40,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:40,746 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:40,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 22:07:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2025-01-09 22:07:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 75 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2025-01-09 22:07:40,748 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 13 [2025-01-09 22:07:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:40,748 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2025-01-09 22:07:40,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2025-01-09 22:07:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:07:40,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:40,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:40,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:07:40,749 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:40,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:40,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1648101098, now seen corresponding path program 1 times [2025-01-09 22:07:40,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:40,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426595073] [2025-01-09 22:07:40,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:40,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:07:40,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:07:40,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:40,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426595073] [2025-01-09 22:07:40,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426595073] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64713441] [2025-01-09 22:07:40,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:40,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:40,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:40,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:07:41,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:07:41,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:07:41,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:41,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:41,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:07:41,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:41,069 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-01-09 22:07:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:41,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:07:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64713441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:41,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:07:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2025-01-09 22:07:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741416123] [2025-01-09 22:07:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:41,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:07:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:41,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:07:41,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:07:41,108 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-01-09 22:07:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:41,205 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2025-01-09 22:07:41,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:07:41,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-01-09 22:07:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:41,206 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:07:41,206 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:07:41,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:07:41,206 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:41,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 186 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:07:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2025-01-09 22:07:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.445945945945946) internal successors, (107), 82 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2025-01-09 22:07:41,208 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 15 [2025-01-09 22:07:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:41,208 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2025-01-09 22:07:41,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-01-09 22:07:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2025-01-09 22:07:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:07:41,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:41,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:41,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:07:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:41,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:41,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash 448539434, now seen corresponding path program 1 times [2025-01-09 22:07:41,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:41,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687715293] [2025-01-09 22:07:41,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:41,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:07:41,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:07:41,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:41,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687715293] [2025-01-09 22:07:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687715293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:41,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:07:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166392612] [2025-01-09 22:07:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:41,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:07:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:41,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:07:41,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:07:41,460 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:41,494 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2025-01-09 22:07:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:07:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:07:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:41,495 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:07:41,495 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:07:41,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:41,496 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:41,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 88 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:07:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 22:07:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 81 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2025-01-09 22:07:41,499 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 16 [2025-01-09 22:07:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:41,499 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2025-01-09 22:07:41,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2025-01-09 22:07:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:07:41,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:41,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:41,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:07:41,501 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:41,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash 448539435, now seen corresponding path program 1 times [2025-01-09 22:07:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21749880] [2025-01-09 22:07:41,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:41,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:07:41,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:07:41,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:41,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:41,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:41,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21749880] [2025-01-09 22:07:41,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21749880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:41,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:41,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:07:41,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739089744] [2025-01-09 22:07:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:41,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:07:41,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:41,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:07:41,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:07:41,645 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:41,714 INFO L93 Difference]: Finished difference Result 100 states and 128 transitions. [2025-01-09 22:07:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:07:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:07:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:41,715 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:07:41,716 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:07:41,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:07:41,717 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:41,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 115 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:07:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-01-09 22:07:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4125) internal successors, (113), 87 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2025-01-09 22:07:41,719 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 16 [2025-01-09 22:07:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:41,719 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2025-01-09 22:07:41,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2025-01-09 22:07:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:07:41,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:41,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:41,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:07:41,720 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:41,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1273403100, now seen corresponding path program 1 times [2025-01-09 22:07:41,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:41,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057385137] [2025-01-09 22:07:41,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:41,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:41,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:07:41,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:07:41,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:41,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057385137] [2025-01-09 22:07:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057385137] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422205993] [2025-01-09 22:07:42,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:42,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:42,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:42,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:07:42,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:07:42,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:07:42,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:42,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:42,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:07:42,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:42,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:07:42,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:07:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:42,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:42,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422205993] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:42,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:42,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-09 22:07:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754391519] [2025-01-09 22:07:42,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:42,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:07:42,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:42,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:07:42,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:07:42,487 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:42,794 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2025-01-09 22:07:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:07:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:07:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:42,795 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:07:42,795 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:07:42,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:07:42,796 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:42,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 113 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:07:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2025-01-09 22:07:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 89 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2025-01-09 22:07:42,798 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 16 [2025-01-09 22:07:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:42,798 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2025-01-09 22:07:42,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2025-01-09 22:07:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:07:42,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:42,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:42,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:07:42,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:42,999 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:43,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash -264872524, now seen corresponding path program 1 times [2025-01-09 22:07:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489387235] [2025-01-09 22:07:43,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:43,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:07:43,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:07:43,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:43,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:43,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489387235] [2025-01-09 22:07:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489387235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:43,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707741476] [2025-01-09 22:07:43,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:43,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:43,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:43,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:07:43,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:07:43,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:07:43,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:43,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:43,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 22:07:43,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:43,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:43,297 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 23 treesize of output 19 [2025-01-09 22:07:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:43,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707741476] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:43,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-01-09 22:07:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463414371] [2025-01-09 22:07:43,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:07:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:43,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:07:43,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:07:43,342 INFO L87 Difference]: Start difference. First operand 90 states and 116 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:43,657 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2025-01-09 22:07:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:07:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 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-01-09 22:07:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:43,659 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:07:43,659 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:07:43,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:07:43,659 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 73 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:43,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 363 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:07:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:07:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 100. [2025-01-09 22:07:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 99 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2025-01-09 22:07:43,661 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 18 [2025-01-09 22:07:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:43,661 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2025-01-09 22:07:43,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2025-01-09 22:07:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:07:43,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:43,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:43,682 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-01-09 22:07:43,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:43,871 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1271750107, now seen corresponding path program 1 times [2025-01-09 22:07:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089842937] [2025-01-09 22:07:43,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:43,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:07:43,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:07:43,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:43,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089842937] [2025-01-09 22:07:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089842937] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873391851] [2025-01-09 22:07:44,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:44,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:44,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:44,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:07:44,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:07:44,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:07:44,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:44,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:07:44,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:44,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:07:44,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:07:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:07:44,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:07:44,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873391851] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:44,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:44,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-09 22:07:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250689969] [2025-01-09 22:07:44,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:44,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:07:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:44,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:07:44,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:07:44,669 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:44,946 INFO L93 Difference]: Finished difference Result 110 states and 143 transitions. [2025-01-09 22:07:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:07:44,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 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-01-09 22:07:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:44,950 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:07:44,950 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:07:44,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:07:44,952 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:44,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 228 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:07:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:07:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2025-01-09 22:07:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.375) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2025-01-09 22:07:44,955 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 18 [2025-01-09 22:07:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:44,955 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2025-01-09 22:07:44,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2025-01-09 22:07:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:07:44,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:44,956 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:44,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:07:45,156 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,SelfDestructingSolverStorable21 [2025-01-09 22:07:45,159 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:45,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash -690780381, now seen corresponding path program 1 times [2025-01-09 22:07:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:45,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899370972] [2025-01-09 22:07:45,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:45,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:07:45,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:07:45,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:45,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:45,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899370972] [2025-01-09 22:07:45,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899370972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:45,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:45,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:07:45,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270294057] [2025-01-09 22:07:45,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:45,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:07:45,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:45,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:07:45,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:45,196 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-01-09 22:07:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:45,209 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-01-09 22:07:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:07:45,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 22:07:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:45,210 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:07:45,210 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:07:45,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:45,210 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:45,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:07:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-01-09 22:07:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.345679012345679) internal successors, (109), 86 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2025-01-09 22:07:45,212 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 21 [2025-01-09 22:07:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:45,212 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2025-01-09 22:07:45,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-01-09 22:07:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2025-01-09 22:07:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:07:45,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:45,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:45,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:07:45,216 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:45,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash -628791403, now seen corresponding path program 1 times [2025-01-09 22:07:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:45,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706069330] [2025-01-09 22:07:45,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:07:45,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:07:45,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:45,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706069330] [2025-01-09 22:07:45,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706069330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:45,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:07:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154203221] [2025-01-09 22:07:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:45,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:07:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:45,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:07:45,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:07:45,259 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:45,285 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2025-01-09 22:07:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:07:45,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 22:07:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:45,286 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:07:45,286 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:07:45,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:45,286 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:45,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 123 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:07:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2025-01-09 22:07:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 86 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2025-01-09 22:07:45,289 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 21 [2025-01-09 22:07:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:45,290 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2025-01-09 22:07:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2025-01-09 22:07:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:07:45,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:45,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:45,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:07:45,291 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:45,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -962438620, now seen corresponding path program 2 times [2025-01-09 22:07:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:45,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761073934] [2025-01-09 22:07:45,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:45,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-09 22:07:45,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:07:45,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:07:45,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761073934] [2025-01-09 22:07:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761073934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194491484] [2025-01-09 22:07:45,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:45,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:45,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:45,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:45,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:07:45,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-09 22:07:45,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:07:45,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:07:45,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:45,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 22:07:45,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:45,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:07:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:45,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:45,815 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 18 treesize of output 16 [2025-01-09 22:07:45,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:07:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194491484] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:45,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:45,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2025-01-09 22:07:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112376194] [2025-01-09 22:07:45,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:45,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:07:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:45,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:07:45,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:07:45,870 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:46,632 INFO L93 Difference]: Finished difference Result 265 states and 320 transitions. [2025-01-09 22:07:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:07:46,632 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 22:07:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:46,633 INFO L225 Difference]: With dead ends: 265 [2025-01-09 22:07:46,633 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 22:07:46,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:07:46,634 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 163 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:46,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1006 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:07:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 22:07:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 160. [2025-01-09 22:07:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 159 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 201 transitions. [2025-01-09 22:07:46,641 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 201 transitions. Word has length 21 [2025-01-09 22:07:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:46,641 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 201 transitions. [2025-01-09 22:07:46,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2025-01-09 22:07:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:07:46,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:46,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:46,647 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-01-09 22:07:46,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:46,843 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:46,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1129272518, now seen corresponding path program 1 times [2025-01-09 22:07:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:46,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438992472] [2025-01-09 22:07:46,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:46,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:07:46,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:07:46,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:46,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:46,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:46,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438992472] [2025-01-09 22:07:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438992472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:46,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76873438] [2025-01-09 22:07:46,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:46,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:46,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:46,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:46,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:07:46,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:07:46,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:07:46,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:46,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:46,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:07:46,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:46,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76873438] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:46,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-01-09 22:07:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588256696] [2025-01-09 22:07:46,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:46,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:07:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:46,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:07:46,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:07:46,976 INFO L87 Difference]: Start difference. First operand 160 states and 201 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:47,012 INFO L93 Difference]: Finished difference Result 206 states and 250 transitions. [2025-01-09 22:07:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:07:47,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:07:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:47,013 INFO L225 Difference]: With dead ends: 206 [2025-01-09 22:07:47,013 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 22:07:47,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:07:47,013 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 26 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:47,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 197 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 22:07:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2025-01-09 22:07:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 175 states have (on average 1.28) internal successors, (224), 180 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 224 transitions. [2025-01-09 22:07:47,022 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 224 transitions. Word has length 23 [2025-01-09 22:07:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:47,022 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 224 transitions. [2025-01-09 22:07:47,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 224 transitions. [2025-01-09 22:07:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:07:47,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:47,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:47,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:07:47,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:07:47,227 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:47,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1476751036, now seen corresponding path program 1 times [2025-01-09 22:07:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906777132] [2025-01-09 22:07:47,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:47,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:47,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:07:47,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:07:47,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:47,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:47,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:47,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906777132] [2025-01-09 22:07:47,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906777132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:47,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:07:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268653647] [2025-01-09 22:07:47,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:47,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:07:47,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:47,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:07:47,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:07:47,329 INFO L87 Difference]: Start difference. First operand 181 states and 224 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:47,376 INFO L93 Difference]: Finished difference Result 255 states and 306 transitions. [2025-01-09 22:07:47,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:07:47,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:07:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:47,378 INFO L225 Difference]: With dead ends: 255 [2025-01-09 22:07:47,378 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 22:07:47,378 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-01-09 22:07:47,378 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:47,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 254 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 22:07:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 213. [2025-01-09 22:07:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.2608695652173914) internal successors, (261), 212 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 261 transitions. [2025-01-09 22:07:47,384 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 261 transitions. Word has length 23 [2025-01-09 22:07:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:47,384 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 261 transitions. [2025-01-09 22:07:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 261 transitions. [2025-01-09 22:07:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:07:47,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:47,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:47,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:07:47,384 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 659102586, now seen corresponding path program 1 times [2025-01-09 22:07:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753453621] [2025-01-09 22:07:47,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:47,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:07:47,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:07:47,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:47,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753453621] [2025-01-09 22:07:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753453621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:47,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:07:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876651207] [2025-01-09 22:07:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:47,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:07:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:47,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:07:47,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:07:47,512 INFO L87 Difference]: Start difference. First operand 213 states and 261 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:47,594 INFO L93 Difference]: Finished difference Result 235 states and 283 transitions. [2025-01-09 22:07:47,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:07:47,595 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:07:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:47,595 INFO L225 Difference]: With dead ends: 235 [2025-01-09 22:07:47,595 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 22:07:47,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:07:47,596 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:47,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 187 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 22:07:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2025-01-09 22:07:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.2741116751269035) internal successors, (251), 202 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-01-09 22:07:47,603 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 23 [2025-01-09 22:07:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:47,603 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-01-09 22:07:47,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-01-09 22:07:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:07:47,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:47,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:47,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:07:47,605 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:47,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:47,606 INFO L85 PathProgramCache]: Analyzing trace with hash -585711594, now seen corresponding path program 1 times [2025-01-09 22:07:47,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:47,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889769346] [2025-01-09 22:07:47,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:47,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:47,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:07:47,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:07:47,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:47,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:47,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889769346] [2025-01-09 22:07:47,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889769346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:47,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:47,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:07:47,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148194082] [2025-01-09 22:07:47,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:47,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:07:47,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:47,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:07:47,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:47,676 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-01-09 22:07:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:47,691 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2025-01-09 22:07:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:07:47,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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) Word has length 24 [2025-01-09 22:07:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:47,693 INFO L225 Difference]: With dead ends: 202 [2025-01-09 22:07:47,693 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 22:07:47,693 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-01-09 22:07:47,694 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:47,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 62 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 22:07:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-01-09 22:07:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.2105263157894737) internal successors, (184), 156 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2025-01-09 22:07:47,696 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 24 [2025-01-09 22:07:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:47,696 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2025-01-09 22:07:47,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-01-09 22:07:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2025-01-09 22:07:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:07:47,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:47,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:47,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:07:47,701 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:47,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1612053760, now seen corresponding path program 1 times [2025-01-09 22:07:47,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:47,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911494939] [2025-01-09 22:07:47,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:47,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:07:47,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:07:47,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:47,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911494939] [2025-01-09 22:07:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911494939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225563860] [2025-01-09 22:07:47,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:47,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:47,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:47,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:47,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:07:47,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:07:47,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:07:47,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:47,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:07:47,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:47,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:48,046 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-01-09 22:07:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:48,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225563860] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:48,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:48,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2025-01-09 22:07:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321838370] [2025-01-09 22:07:48,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:48,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:07:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:48,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:07:48,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:07:48,076 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:48,262 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2025-01-09 22:07:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:07:48,263 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 22:07:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:48,263 INFO L225 Difference]: With dead ends: 213 [2025-01-09 22:07:48,264 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 22:07:48,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:07:48,264 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 66 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:48,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 461 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:07:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 22:07:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 158. [2025-01-09 22:07:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.2156862745098038) internal successors, (186), 157 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2025-01-09 22:07:48,268 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 24 [2025-01-09 22:07:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:48,268 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2025-01-09 22:07:48,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2025-01-09 22:07:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:07:48,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:48,268 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:48,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:07:48,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:48,473 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:48,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1189601658, now seen corresponding path program 2 times [2025-01-09 22:07:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:48,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445633059] [2025-01-09 22:07:48,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:48,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:48,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-09 22:07:48,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 25 statements. [2025-01-09 22:07:48,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:07:48,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:07:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445633059] [2025-01-09 22:07:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445633059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:07:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820643007] [2025-01-09 22:07:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:48,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:07:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:07:48,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:07:48,523 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:48,536 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2025-01-09 22:07:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:07:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-01-09 22:07:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:48,537 INFO L225 Difference]: With dead ends: 157 [2025-01-09 22:07:48,537 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 22:07:48,537 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-01-09 22:07:48,537 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:48,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 22:07:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2025-01-09 22:07:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.178294573643411) internal successors, (152), 132 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2025-01-09 22:07:48,540 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 25 [2025-01-09 22:07:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:48,540 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2025-01-09 22:07:48,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2025-01-09 22:07:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:07:48,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:48,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:48,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:07:48,540 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1546271128, now seen corresponding path program 1 times [2025-01-09 22:07:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832669250] [2025-01-09 22:07:48,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:48,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:07:48,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:07:48,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:48,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832669250] [2025-01-09 22:07:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832669250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:07:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894572298] [2025-01-09 22:07:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:48,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:07:48,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:48,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:07:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:07:48,676 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:48,725 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions. [2025-01-09 22:07:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:07:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 22:07:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:48,726 INFO L225 Difference]: With dead ends: 201 [2025-01-09 22:07:48,726 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 22:07:48,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:07:48,727 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:48,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 174 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 22:07:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 136. [2025-01-09 22:07:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 135 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-01-09 22:07:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2025-01-09 22:07:48,732 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 26 [2025-01-09 22:07:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:48,733 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2025-01-09 22:07:48,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2025-01-09 22:07:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:07:48,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:48,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:48,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:07:48,735 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash 174699734, now seen corresponding path program 3 times [2025-01-09 22:07:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:48,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918960401] [2025-01-09 22:07:48,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:07:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:48,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-01-09 22:07:48,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:07:48,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 22:07:48,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918960401] [2025-01-09 22:07:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918960401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405795581] [2025-01-09 22:07:49,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:07:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:49,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:49,012 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:49,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:07:49,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-01-09 22:07:49,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:07:49,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 22:07:49,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:49,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 22:07:49,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:49,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:07:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:49,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:49,219 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 18 treesize of output 16 [2025-01-09 22:07:49,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:07:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:49,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405795581] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:49,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:49,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 24 [2025-01-09 22:07:49,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589886041] [2025-01-09 22:07:49,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:49,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:07:49,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:49,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:07:49,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:07:49,277 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:49,807 INFO L93 Difference]: Finished difference Result 287 states and 318 transitions. [2025-01-09 22:07:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 22:07:49,807 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 22:07:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:49,808 INFO L225 Difference]: With dead ends: 287 [2025-01-09 22:07:49,808 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 22:07:49,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 22:07:49,809 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 112 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:49,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 718 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:07:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 22:07:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 176. [2025-01-09 22:07:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.1686046511627908) internal successors, (201), 175 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2025-01-09 22:07:49,812 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 27 [2025-01-09 22:07:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:49,812 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2025-01-09 22:07:49,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2025-01-09 22:07:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:07:49,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:49,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:49,822 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-01-09 22:07:50,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:50,014 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:50,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1955687522, now seen corresponding path program 1 times [2025-01-09 22:07:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:50,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322812954] [2025-01-09 22:07:50,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:50,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:50,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:07:50,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:07:50,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:50,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322812954] [2025-01-09 22:07:50,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322812954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060900139] [2025-01-09 22:07:50,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:50,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:50,149 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:50,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:07:50,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:07:50,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:07:50,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:50,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:50,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 22:07:50,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:50,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:50,378 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-01-09 22:07:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060900139] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:50,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-01-09 22:07:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126461144] [2025-01-09 22:07:50,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:50,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:07:50,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:50,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:07:50,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:07:50,396 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand has 21 states, 20 states have (on average 3.0) internal successors, (60), 21 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-01-09 22:07:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:50,537 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2025-01-09 22:07:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:07:50,537 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 21 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-01-09 22:07:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:50,538 INFO L225 Difference]: With dead ends: 202 [2025-01-09 22:07:50,538 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 22:07:50,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:07:50,538 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:50,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 300 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 22:07:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 190. [2025-01-09 22:07:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 186 states have (on average 1.1559139784946237) internal successors, (215), 189 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2025-01-09 22:07:50,541 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 29 [2025-01-09 22:07:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:50,541 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2025-01-09 22:07:50,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 21 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-01-09 22:07:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2025-01-09 22:07:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:07:50,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:50,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:50,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:07:50,746 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,SelfDestructingSolverStorable33 [2025-01-09 22:07:50,746 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:50,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1460223310, now seen corresponding path program 2 times [2025-01-09 22:07:50,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:50,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095004695] [2025-01-09 22:07:50,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:50,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 22:07:50,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:07:50,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:07:50,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095004695] [2025-01-09 22:07:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095004695] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770892740] [2025-01-09 22:07:51,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:51,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:51,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:51,042 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:51,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:07:51,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 22:07:51,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:07:51,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:07:51,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:51,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 22:07:51,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:51,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:51,424 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 23 treesize of output 19 [2025-01-09 22:07:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:51,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770892740] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:51,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-01-09 22:07:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136855406] [2025-01-09 22:07:51,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:51,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 22:07:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:51,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 22:07:51,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:07:51,528 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 31 states, 30 states have (on average 2.8) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:52,065 INFO L93 Difference]: Finished difference Result 313 states and 345 transitions. [2025-01-09 22:07:52,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:07:52,065 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.8) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 22:07:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:52,066 INFO L225 Difference]: With dead ends: 313 [2025-01-09 22:07:52,066 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 22:07:52,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 22:07:52,067 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 139 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:52,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 774 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:07:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 22:07:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 221. [2025-01-09 22:07:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 217 states have (on average 1.1474654377880185) internal successors, (249), 220 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 249 transitions. [2025-01-09 22:07:52,073 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 249 transitions. Word has length 30 [2025-01-09 22:07:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:52,073 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 249 transitions. [2025-01-09 22:07:52,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.8) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 249 transitions. [2025-01-09 22:07:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:07:52,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:52,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:52,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:07:52,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:52,278 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:52,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1381530908, now seen corresponding path program 1 times [2025-01-09 22:07:52,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:52,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371768388] [2025-01-09 22:07:52,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:52,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:52,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:07:52,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:07:52,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:52,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:52,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:52,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371768388] [2025-01-09 22:07:52,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371768388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:52,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914890524] [2025-01-09 22:07:52,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:52,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:52,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:52,644 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:52,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:07:52,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:07:52,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:07:52,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:52,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:52,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:07:52,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:52,740 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-01-09 22:07:52,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:07:52,744 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-01-09 22:07:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:53,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914890524] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:53,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:53,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2025-01-09 22:07:53,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528139014] [2025-01-09 22:07:53,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:53,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:07:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:53,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:07:53,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:07:53,508 INFO L87 Difference]: Start difference. First operand 221 states and 249 transitions. Second operand has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:54,729 INFO L93 Difference]: Finished difference Result 322 states and 353 transitions. [2025-01-09 22:07:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 22:07:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 22:07:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:54,730 INFO L225 Difference]: With dead ends: 322 [2025-01-09 22:07:54,730 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 22:07:54,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=519, Invalid=3641, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 22:07:54,731 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 215 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:54,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 394 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:07:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 22:07:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 260. [2025-01-09 22:07:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 256 states have (on average 1.140625) internal successors, (292), 259 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 292 transitions. [2025-01-09 22:07:54,735 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 292 transitions. Word has length 33 [2025-01-09 22:07:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:54,735 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 292 transitions. [2025-01-09 22:07:54,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 292 transitions. [2025-01-09 22:07:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:07:54,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:54,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:54,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 22:07:54,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:54,940 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:54,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1381521808, now seen corresponding path program 1 times [2025-01-09 22:07:54,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:54,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113071496] [2025-01-09 22:07:54,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:54,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:07:54,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:07:54,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:54,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:55,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113071496] [2025-01-09 22:07:55,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113071496] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121616119] [2025-01-09 22:07:55,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:55,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:55,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:55,178 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:55,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:07:55,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:07:55,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:07:55,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:55,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:55,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-01-09 22:07:55,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:55,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:07:55,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 7 [2025-01-09 22:07:55,324 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-01-09 22:07:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:56,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:56,563 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:07:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:56,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121616119] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:56,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:56,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 33 [2025-01-09 22:07:56,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445135002] [2025-01-09 22:07:56,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:56,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:07:56,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:56,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:07:56,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:07:56,616 INFO L87 Difference]: Start difference. First operand 260 states and 292 transitions. Second operand has 34 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 34 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-01-09 22:07:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:57,364 INFO L93 Difference]: Finished difference Result 307 states and 338 transitions. [2025-01-09 22:07:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:07:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 34 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) Word has length 33 [2025-01-09 22:07:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:57,365 INFO L225 Difference]: With dead ends: 307 [2025-01-09 22:07:57,365 INFO L226 Difference]: Without dead ends: 307 [2025-01-09 22:07:57,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1793, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 22:07:57,366 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 133 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:57,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 307 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:07:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-09 22:07:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 249. [2025-01-09 22:07:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 245 states have (on average 1.1387755102040817) internal successors, (279), 248 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 279 transitions. [2025-01-09 22:07:57,369 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 279 transitions. Word has length 33 [2025-01-09 22:07:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:57,369 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 279 transitions. [2025-01-09 22:07:57,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 34 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-01-09 22:07:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 279 transitions. [2025-01-09 22:07:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:07:57,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:57,370 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:57,376 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-01-09 22:07:57,570 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,SelfDestructingSolverStorable36 [2025-01-09 22:07:57,571 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:57,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash -888441228, now seen corresponding path program 4 times [2025-01-09 22:07:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:57,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737450744] [2025-01-09 22:07:57,571 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:07:57,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:57,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:07:57,583 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:07:57,583 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:07:57,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:07:57,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737450744] [2025-01-09 22:07:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737450744] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323010199] [2025-01-09 22:07:57,762 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:07:57,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:57,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:57,770 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:57,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:07:57,831 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:07:57,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:07:57,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:07:57,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:57,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 22:07:57,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:57,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:07:57,898 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-01-09 22:07:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:07:57,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:57,914 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 18 treesize of output 16 [2025-01-09 22:07:57,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:07:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:07:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323010199] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:57,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:57,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 17 [2025-01-09 22:07:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241097989] [2025-01-09 22:07:57,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:57,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:07:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:57,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:07:57,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:07:57,958 INFO L87 Difference]: Start difference. First operand 249 states and 279 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:58,138 INFO L93 Difference]: Finished difference Result 366 states and 404 transitions. [2025-01-09 22:07:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:07:58,138 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:07:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:58,139 INFO L225 Difference]: With dead ends: 366 [2025-01-09 22:07:58,139 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 22:07:58,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:07:58,140 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 39 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:58,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 653 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:07:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 22:07:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 276. [2025-01-09 22:07:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 272 states have (on average 1.1433823529411764) internal successors, (311), 275 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2025-01-09 22:07:58,146 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 36 [2025-01-09 22:07:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:58,146 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2025-01-09 22:07:58,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2025-01-09 22:07:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:07:58,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:58,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:58,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 22:07:58,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 22:07:58,352 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:07:58,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1541379225, now seen corresponding path program 2 times [2025-01-09 22:07:58,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:58,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802498210] [2025-01-09 22:07:58,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:58,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:07:58,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:07:58,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:07:58,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802498210] [2025-01-09 22:07:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802498210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945959517] [2025-01-09 22:07:58,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:58,776 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:07:58,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:07:58,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:07:58,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:07:58,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:07:58,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:58,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 22:07:58,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:58,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:07:59,241 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:07:59,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:07:59,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2025-01-09 22:07:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:59,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:59,373 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-01-09 22:07:59,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-09 22:07:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945959517] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:59,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:59,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 31 [2025-01-09 22:07:59,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625579102] [2025-01-09 22:07:59,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:59,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 22:07:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:59,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 22:07:59,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:07:59,536 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:59,882 INFO L93 Difference]: Finished difference Result 280 states and 312 transitions. [2025-01-09 22:07:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:07:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:07:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:59,883 INFO L225 Difference]: With dead ends: 280 [2025-01-09 22:07:59,883 INFO L226 Difference]: Without dead ends: 242 [2025-01-09 22:07:59,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 22:07:59,883 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:59,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 339 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:07:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-01-09 22:07:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2025-01-09 22:07:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 237 states have (on average 1.1476793248945147) internal successors, (272), 240 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2025-01-09 22:07:59,890 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 36 [2025-01-09 22:07:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:59,890 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2025-01-09 22:07:59,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2025-01-09 22:07:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:07:59,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:59,892 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:59,898 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-01-09 22:08:00,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-09 22:08:00,092 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:00,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash 390643862, now seen corresponding path program 5 times [2025-01-09 22:08:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:00,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915801508] [2025-01-09 22:08:00,093 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:08:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:00,101 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 6 equivalence classes. [2025-01-09 22:08:00,111 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:08:00,111 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-09 22:08:00,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:00,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:00,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915801508] [2025-01-09 22:08:00,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915801508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:00,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387695995] [2025-01-09 22:08:00,585 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:08:00,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:00,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:00,588 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:00,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:08:00,653 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 6 equivalence classes. [2025-01-09 22:08:00,675 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:08:00,675 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-09 22:08:00,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:00,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 22:08:00,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:00,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:08:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:00,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:01,004 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 18 treesize of output 16 [2025-01-09 22:08:01,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:08:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387695995] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:01,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:01,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 34 [2025-01-09 22:08:01,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136668489] [2025-01-09 22:08:01,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:01,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:08:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:01,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:08:01,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1046, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:08:01,082 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:02,378 INFO L93 Difference]: Finished difference Result 435 states and 476 transitions. [2025-01-09 22:08:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 22:08:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 22:08:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:02,380 INFO L225 Difference]: With dead ends: 435 [2025-01-09 22:08:02,380 INFO L226 Difference]: Without dead ends: 367 [2025-01-09 22:08:02,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=214, Invalid=2978, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 22:08:02,381 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 121 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:02,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1701 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:08:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-09 22:08:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 263. [2025-01-09 22:08:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.1505791505791505) internal successors, (298), 262 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 298 transitions. [2025-01-09 22:08:02,385 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 298 transitions. Word has length 39 [2025-01-09 22:08:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:02,385 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 298 transitions. [2025-01-09 22:08:02,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 298 transitions. [2025-01-09 22:08:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:08:02,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:02,385 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:02,399 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-01-09 22:08:02,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-01-09 22:08:02,586 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:02,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1687389982, now seen corresponding path program 2 times [2025-01-09 22:08:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:02,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059662182] [2025-01-09 22:08:02,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:08:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:02,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 22:08:02,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:08:02,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:08:02,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:02,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059662182] [2025-01-09 22:08:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059662182] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369178181] [2025-01-09 22:08:02,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:08:02,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:02,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:02,848 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:02,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 22:08:02,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 22:08:02,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:08:02,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:08:02,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:02,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-09 22:08:02,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:02,945 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-01-09 22:08:02,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:08:02,947 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-01-09 22:08:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:03,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:03,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369178181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:03,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:03,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2025-01-09 22:08:03,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729350928] [2025-01-09 22:08:03,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:03,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:08:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:03,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:08:03,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:08:03,714 INFO L87 Difference]: Start difference. First operand 263 states and 298 transitions. Second operand has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:04,847 INFO L93 Difference]: Finished difference Result 351 states and 389 transitions. [2025-01-09 22:08:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 22:08:04,848 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 22:08:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:04,849 INFO L225 Difference]: With dead ends: 351 [2025-01-09 22:08:04,849 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 22:08:04,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 22:08:04,850 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 161 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:04,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 829 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:08:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 22:08:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 294. [2025-01-09 22:08:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 290 states have (on average 1.1482758620689655) internal successors, (333), 293 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 333 transitions. [2025-01-09 22:08:04,853 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 333 transitions. Word has length 39 [2025-01-09 22:08:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:04,853 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 333 transitions. [2025-01-09 22:08:04,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 333 transitions. [2025-01-09 22:08:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:08:04,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:04,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:04,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-01-09 22:08:05,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:05,058 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1703039479, now seen corresponding path program 3 times [2025-01-09 22:08:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095402223] [2025-01-09 22:08:05,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:05,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-01-09 22:08:05,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:08:05,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:08:05,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:05,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095402223] [2025-01-09 22:08:05,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095402223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449585249] [2025-01-09 22:08:05,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:05,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:05,266 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:05,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-09 22:08:05,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-01-09 22:08:05,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:08:05,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:08:05,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:05,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:08:05,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:05,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:08:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:05,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:05,467 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-01-09 22:08:05,469 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-01-09 22:08:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449585249] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:05,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:05,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 23 [2025-01-09 22:08:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464866552] [2025-01-09 22:08:05,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:05,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:08:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:05,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:08:05,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:08:05,504 INFO L87 Difference]: Start difference. First operand 294 states and 333 transitions. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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-01-09 22:08:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:05,625 INFO L93 Difference]: Finished difference Result 489 states and 544 transitions. [2025-01-09 22:08:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:08:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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) Word has length 39 [2025-01-09 22:08:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:05,626 INFO L225 Difference]: With dead ends: 489 [2025-01-09 22:08:05,626 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 22:08:05,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:08:05,626 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:05,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 333 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:08:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 22:08:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 353. [2025-01-09 22:08:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.1375358166189111) internal successors, (397), 352 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 397 transitions. [2025-01-09 22:08:05,630 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 397 transitions. Word has length 39 [2025-01-09 22:08:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:05,630 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 397 transitions. [2025-01-09 22:08:05,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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-01-09 22:08:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 397 transitions. [2025-01-09 22:08:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:08:05,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:05,631 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:05,637 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-01-09 22:08:05,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:05,835 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:05,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 664709940, now seen corresponding path program 6 times [2025-01-09 22:08:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:05,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560069632] [2025-01-09 22:08:05,836 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:08:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:05,842 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 6 equivalence classes. [2025-01-09 22:08:05,855 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:08:05,855 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-09 22:08:05,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:06,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:06,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560069632] [2025-01-09 22:08:06,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560069632] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:06,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256727237] [2025-01-09 22:08:06,234 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:08:06,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:06,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:06,236 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:06,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-09 22:08:06,305 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 6 equivalence classes. [2025-01-09 22:08:06,340 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:08:06,340 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-09 22:08:06,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:06,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 22:08:06,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:06,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:06,714 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 23 treesize of output 19 [2025-01-09 22:08:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256727237] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:06,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:06,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2025-01-09 22:08:06,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254350355] [2025-01-09 22:08:06,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:06,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 22:08:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:06,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 22:08:06,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 22:08:06,876 INFO L87 Difference]: Start difference. First operand 353 states and 397 transitions. Second operand has 38 states, 37 states have (on average 2.864864864864865) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:07,695 INFO L93 Difference]: Finished difference Result 555 states and 607 transitions. [2025-01-09 22:08:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 22:08:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.864864864864865) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-09 22:08:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:07,697 INFO L225 Difference]: With dead ends: 555 [2025-01-09 22:08:07,697 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 22:08:07,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=2250, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 22:08:07,698 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 195 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:07,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 923 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:08:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 22:08:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 409. [2025-01-09 22:08:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.125925925925926) internal successors, (456), 408 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2025-01-09 22:08:07,702 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 456 transitions. Word has length 42 [2025-01-09 22:08:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:07,702 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 456 transitions. [2025-01-09 22:08:07,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.864864864864865) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 456 transitions. [2025-01-09 22:08:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:08:07,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:07,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:07,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-01-09 22:08:07,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:07,907 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:07,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash 560306187, now seen corresponding path program 4 times [2025-01-09 22:08:07,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:07,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136879881] [2025-01-09 22:08:07,908 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:08:07,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:07,914 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:08:07,921 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-01-09 22:08:07,921 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:08:07,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:08,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136879881] [2025-01-09 22:08:08,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136879881] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016800113] [2025-01-09 22:08:08,233 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:08:08,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:08,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:08,235 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:08,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-09 22:08:08,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:08:08,340 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-01-09 22:08:08,341 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:08:08,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:08,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 22:08:08,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:08,361 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-01-09 22:08:08,417 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-01-09 22:08:08,700 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-01-09 22:08:08,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2025-01-09 22:08:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:08:08,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:09,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-09 22:08:09,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 22:08:09,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-01-09 22:08:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:08:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016800113] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:09,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 36 [2025-01-09 22:08:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270730120] [2025-01-09 22:08:09,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:09,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:08:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:09,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:08:09,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 22:08:09,247 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand has 37 states, 36 states have (on average 2.25) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:09,673 INFO L93 Difference]: Finished difference Result 424 states and 466 transitions. [2025-01-09 22:08:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:08:09,673 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.25) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-09 22:08:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:09,674 INFO L225 Difference]: With dead ends: 424 [2025-01-09 22:08:09,674 INFO L226 Difference]: Without dead ends: 424 [2025-01-09 22:08:09,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1512, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 22:08:09,675 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:09,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 336 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:08:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-09 22:08:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 358. [2025-01-09 22:08:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 355 states have (on average 1.123943661971831) internal successors, (399), 357 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 399 transitions. [2025-01-09 22:08:09,679 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 399 transitions. Word has length 42 [2025-01-09 22:08:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:09,679 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 399 transitions. [2025-01-09 22:08:09,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.25) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 399 transitions. [2025-01-09 22:08:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:08:09,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:09,680 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:09,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-01-09 22:08:09,884 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,SelfDestructingSolverStorable43 [2025-01-09 22:08:09,884 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:09,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1296731482, now seen corresponding path program 3 times [2025-01-09 22:08:09,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:09,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669378921] [2025-01-09 22:08:09,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:09,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:09,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 7 equivalence classes. [2025-01-09 22:08:09,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:08:09,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 22:08:09,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669378921] [2025-01-09 22:08:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669378921] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053618781] [2025-01-09 22:08:10,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:10,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:10,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:10,339 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:10,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-09 22:08:10,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 7 equivalence classes. [2025-01-09 22:08:10,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:08:10,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 22:08:10,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:10,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-09 22:08:10,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:10,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:08:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 11 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:10,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:10,770 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 18 treesize of output 16 [2025-01-09 22:08:10,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:08:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 11 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053618781] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:10,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 37 [2025-01-09 22:08:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481823435] [2025-01-09 22:08:10,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:10,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:08:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:10,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:08:10,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 22:08:10,833 INFO L87 Difference]: Start difference. First operand 358 states and 399 transitions. Second operand has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:12,170 INFO L93 Difference]: Finished difference Result 640 states and 697 transitions. [2025-01-09 22:08:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 22:08:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-09 22:08:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:12,171 INFO L225 Difference]: With dead ends: 640 [2025-01-09 22:08:12,171 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 22:08:12,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=368, Invalid=3792, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 22:08:12,176 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 349 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:12,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1592 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:08:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 22:08:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 375. [2025-01-09 22:08:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 372 states have (on average 1.1290322580645162) internal successors, (420), 374 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 420 transitions. [2025-01-09 22:08:12,183 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 420 transitions. Word has length 45 [2025-01-09 22:08:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:12,183 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 420 transitions. [2025-01-09 22:08:12,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 420 transitions. [2025-01-09 22:08:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:08:12,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:12,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:12,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-01-09 22:08:12,384 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,SelfDestructingSolverStorable44 [2025-01-09 22:08:12,388 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:12,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -45215257, now seen corresponding path program 2 times [2025-01-09 22:08:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:12,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617864200] [2025-01-09 22:08:12,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:08:12,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:12,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-09 22:08:12,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:08:12,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:08:12,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617864200] [2025-01-09 22:08:12,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617864200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:12,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720278394] [2025-01-09 22:08:12,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:08:12,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:12,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:12,768 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:12,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-09 22:08:12,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-09 22:08:12,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:08:12,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:08:12,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:12,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-01-09 22:08:12,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:12,916 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-01-09 22:08:12,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:08:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:13,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:14,383 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:08:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720278394] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:14,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:14,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 18] total 47 [2025-01-09 22:08:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702179429] [2025-01-09 22:08:14,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:14,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:08:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:14,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:08:14,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1948, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:08:14,474 INFO L87 Difference]: Start difference. First operand 375 states and 420 transitions. Second operand has 48 states, 47 states have (on average 2.893617021276596) internal successors, (136), 48 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-01-09 22:08:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:15,852 INFO L93 Difference]: Finished difference Result 553 states and 600 transitions. [2025-01-09 22:08:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-09 22:08:15,852 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.893617021276596) internal successors, (136), 48 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 49 [2025-01-09 22:08:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:15,857 INFO L225 Difference]: With dead ends: 553 [2025-01-09 22:08:15,861 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 22:08:15,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=793, Invalid=4609, Unknown=0, NotChecked=0, Total=5402 [2025-01-09 22:08:15,863 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 271 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:15,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 527 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:08:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 22:08:15,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 376. [2025-01-09 22:08:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 373 states have (on average 1.123324396782842) internal successors, (419), 375 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 419 transitions. [2025-01-09 22:08:15,870 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 419 transitions. Word has length 49 [2025-01-09 22:08:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:15,870 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 419 transitions. [2025-01-09 22:08:15,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.893617021276596) internal successors, (136), 48 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-01-09 22:08:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 419 transitions. [2025-01-09 22:08:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:08:15,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:15,871 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:15,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-01-09 22:08:16,075 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,SelfDestructingSolverStorable45 [2025-01-09 22:08:16,075 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:16,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:16,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1769282646, now seen corresponding path program 7 times [2025-01-09 22:08:16,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:16,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062560266] [2025-01-09 22:08:16,076 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 22:08:16,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:16,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:08:16,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:08:16,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:08:16,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 22 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062560266] [2025-01-09 22:08:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062560266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:16,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475440955] [2025-01-09 22:08:16,629 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 22:08:16,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:16,631 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:16,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-01-09 22:08:16,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:08:16,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:08:16,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:08:16,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:16,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-09 22:08:16,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:16,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:08:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 13 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:17,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:17,152 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 18 treesize of output 16 [2025-01-09 22:08:17,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:08:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 13 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:17,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475440955] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:17,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 39 [2025-01-09 22:08:17,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513765250] [2025-01-09 22:08:17,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:17,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 22:08:17,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:17,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 22:08:17,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 22:08:17,236 INFO L87 Difference]: Start difference. First operand 376 states and 419 transitions. Second operand has 39 states, 39 states have (on average 2.6153846153846154) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:19,042 INFO L93 Difference]: Finished difference Result 649 states and 706 transitions. [2025-01-09 22:08:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 22:08:19,043 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6153846153846154) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-09 22:08:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:19,044 INFO L225 Difference]: With dead ends: 649 [2025-01-09 22:08:19,044 INFO L226 Difference]: Without dead ends: 559 [2025-01-09 22:08:19,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=306, Invalid=4524, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 22:08:19,046 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 144 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:19,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2473 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 22:08:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-01-09 22:08:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 454. [2025-01-09 22:08:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 451 states have (on average 1.1219512195121952) internal successors, (506), 453 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 506 transitions. [2025-01-09 22:08:19,056 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 506 transitions. Word has length 51 [2025-01-09 22:08:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:19,056 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 506 transitions. [2025-01-09 22:08:19,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6153846153846154) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 506 transitions. [2025-01-09 22:08:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:08:19,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:19,058 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:19,066 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-01-09 22:08:19,262 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,SelfDestructingSolverStorable46 [2025-01-09 22:08:19,263 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:19,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:19,263 INFO L85 PathProgramCache]: Analyzing trace with hash 689618210, now seen corresponding path program 3 times [2025-01-09 22:08:19,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:19,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901550311] [2025-01-09 22:08:19,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:19,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:19,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 5 equivalence classes. [2025-01-09 22:08:19,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:08:19,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 22:08:19,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:19,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:19,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901550311] [2025-01-09 22:08:19,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901550311] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262127352] [2025-01-09 22:08:19,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:19,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:19,897 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:19,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-01-09 22:08:19,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 5 equivalence classes. [2025-01-09 22:08:20,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:08:20,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 22:08:20,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:20,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-01-09 22:08:20,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:20,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:08:20,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:08:20,048 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-01-09 22:08:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:20,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:21,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262127352] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:21,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:21,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 47 [2025-01-09 22:08:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221386334] [2025-01-09 22:08:21,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:21,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:08:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:21,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:08:21,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2032, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:08:21,049 INFO L87 Difference]: Start difference. First operand 454 states and 506 transitions. Second operand has 48 states, 47 states have (on average 3.127659574468085) internal successors, (147), 48 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:22,599 INFO L93 Difference]: Finished difference Result 648 states and 702 transitions. [2025-01-09 22:08:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 22:08:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.127659574468085) internal successors, (147), 48 states have internal predecessors, (147), 0 states have call successors, (0), 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 51 [2025-01-09 22:08:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:22,601 INFO L225 Difference]: With dead ends: 648 [2025-01-09 22:08:22,601 INFO L226 Difference]: Without dead ends: 612 [2025-01-09 22:08:22,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=730, Invalid=5590, Unknown=0, NotChecked=0, Total=6320 [2025-01-09 22:08:22,602 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 310 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:22,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 911 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:08:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-09 22:08:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 477. [2025-01-09 22:08:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 474 states have (on average 1.1160337552742616) internal successors, (529), 476 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 529 transitions. [2025-01-09 22:08:22,607 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 529 transitions. Word has length 51 [2025-01-09 22:08:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:22,607 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 529 transitions. [2025-01-09 22:08:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.127659574468085) internal successors, (147), 48 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 529 transitions. [2025-01-09 22:08:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:08:22,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:22,608 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:22,615 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-01-09 22:08:22,808 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,SelfDestructingSolverStorable47 [2025-01-09 22:08:22,809 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:22,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2070892824, now seen corresponding path program 4 times [2025-01-09 22:08:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115031154] [2025-01-09 22:08:22,810 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:08:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:22,817 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:08:22,823 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 53 statements. [2025-01-09 22:08:22,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:08:22,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:08:23,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:23,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115031154] [2025-01-09 22:08:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115031154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:23,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394804499] [2025-01-09 22:08:23,289 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:08:23,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:23,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:23,293 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:23,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-01-09 22:08:23,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:08:23,410 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 53 statements. [2025-01-09 22:08:23,411 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:08:23,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:23,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 22:08:23,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:23,500 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-01-09 22:08:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:08:23,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:23,876 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-01-09 22:08:23,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:08:23,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-01-09 22:08:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:08:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394804499] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:24,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:24,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 35 [2025-01-09 22:08:24,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538787684] [2025-01-09 22:08:24,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:24,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:08:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:24,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:08:24,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:08:24,045 INFO L87 Difference]: Start difference. First operand 477 states and 529 transitions. Second operand has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:24,315 INFO L93 Difference]: Finished difference Result 833 states and 912 transitions. [2025-01-09 22:08:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:08:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 22:08:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:24,316 INFO L225 Difference]: With dead ends: 833 [2025-01-09 22:08:24,316 INFO L226 Difference]: Without dead ends: 723 [2025-01-09 22:08:24,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=1495, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 22:08:24,317 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:24,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 515 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:08:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-01-09 22:08:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 635. [2025-01-09 22:08:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 632 states have (on average 1.1044303797468353) internal successors, (698), 634 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 698 transitions. [2025-01-09 22:08:24,333 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 698 transitions. Word has length 53 [2025-01-09 22:08:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:24,333 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 698 transitions. [2025-01-09 22:08:24,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 698 transitions. [2025-01-09 22:08:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:08:24,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:24,334 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:24,342 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-01-09 22:08:24,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-01-09 22:08:24,536 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:24,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2121094706, now seen corresponding path program 4 times [2025-01-09 22:08:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:24,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331739474] [2025-01-09 22:08:24,537 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:08:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:24,546 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-01-09 22:08:24,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:08:24,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:08:24,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331739474] [2025-01-09 22:08:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331739474] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802705220] [2025-01-09 22:08:24,895 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:08:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:24,896 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:24,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-01-09 22:08:24,994 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-01-09 22:08:25,052 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:08:25,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:08:25,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:25,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-01-09 22:08:25,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:25,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:25,550 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 23 treesize of output 19 [2025-01-09 22:08:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:25,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802705220] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:25,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:25,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 45 [2025-01-09 22:08:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117476002] [2025-01-09 22:08:25,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:25,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 22:08:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:25,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 22:08:25,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1790, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 22:08:25,744 INFO L87 Difference]: Start difference. First operand 635 states and 698 transitions. Second operand has 46 states, 45 states have (on average 2.911111111111111) internal successors, (131), 46 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:26,228 INFO L93 Difference]: Finished difference Result 820 states and 891 transitions. [2025-01-09 22:08:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:08:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.911111111111111) internal successors, (131), 46 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 22:08:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:26,230 INFO L225 Difference]: With dead ends: 820 [2025-01-09 22:08:26,230 INFO L226 Difference]: Without dead ends: 800 [2025-01-09 22:08:26,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1856, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 22:08:26,231 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 211 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:26,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1285 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:08:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-09 22:08:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 624. [2025-01-09 22:08:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 621 states have (on average 1.106280193236715) internal successors, (687), 623 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 687 transitions. [2025-01-09 22:08:26,238 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 687 transitions. Word has length 54 [2025-01-09 22:08:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:26,242 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 687 transitions. [2025-01-09 22:08:26,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.911111111111111) internal successors, (131), 46 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 687 transitions. [2025-01-09 22:08:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:08:26,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:26,243 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:26,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-01-09 22:08:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-01-09 22:08:26,444 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1847667969, now seen corresponding path program 5 times [2025-01-09 22:08:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411354802] [2025-01-09 22:08:26,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:08:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:26,456 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 4 equivalence classes. [2025-01-09 22:08:26,464 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:08:26,467 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 22:08:26,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411354802] [2025-01-09 22:08:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411354802] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600525203] [2025-01-09 22:08:26,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:08:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:26,992 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:26,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-01-09 22:08:27,085 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 4 equivalence classes. [2025-01-09 22:08:27,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:08:27,115 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 22:08:27,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:27,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 22:08:27,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:27,147 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 22:08:27,147 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 1 case distinctions, treesize of input 13 treesize of output 11 [2025-01-09 22:08:27,160 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-01-09 22:08:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:27,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:28,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600525203] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:28,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:28,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 50 [2025-01-09 22:08:28,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033259280] [2025-01-09 22:08:28,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:28,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 22:08:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:28,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 22:08:28,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2277, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 22:08:28,715 INFO L87 Difference]: Start difference. First operand 624 states and 687 transitions. Second operand has 51 states, 50 states have (on average 2.92) internal successors, (146), 51 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:30,354 INFO L93 Difference]: Finished difference Result 805 states and 868 transitions. [2025-01-09 22:08:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 22:08:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.92) internal successors, (146), 51 states have internal predecessors, (146), 0 states have call successors, (0), 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 55 [2025-01-09 22:08:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:30,356 INFO L225 Difference]: With dead ends: 805 [2025-01-09 22:08:30,356 INFO L226 Difference]: Without dead ends: 767 [2025-01-09 22:08:30,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=791, Invalid=6181, Unknown=0, NotChecked=0, Total=6972 [2025-01-09 22:08:30,356 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 199 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:30,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 747 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:08:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-01-09 22:08:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 619. [2025-01-09 22:08:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 616 states have (on average 1.1055194805194806) internal successors, (681), 618 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 681 transitions. [2025-01-09 22:08:30,368 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 681 transitions. Word has length 55 [2025-01-09 22:08:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:30,368 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 681 transitions. [2025-01-09 22:08:30,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.92) internal successors, (146), 51 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 681 transitions. [2025-01-09 22:08:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:08:30,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:30,369 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:30,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-01-09 22:08:30,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:30,570 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1528000614, now seen corresponding path program 6 times [2025-01-09 22:08:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:30,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594607976] [2025-01-09 22:08:30,571 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:08:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:30,578 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 4 equivalence classes. [2025-01-09 22:08:30,585 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:08:30,585 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-09 22:08:30,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 22:08:30,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:30,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594607976] [2025-01-09 22:08:30,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594607976] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:30,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876918570] [2025-01-09 22:08:30,648 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:08:30,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:30,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:30,650 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:30,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-01-09 22:08:30,743 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 4 equivalence classes. [2025-01-09 22:08:30,783 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:08:30,783 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-09 22:08:30,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:30,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:08:30,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 22:08:30,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 22:08:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876918570] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:30,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-09 22:08:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768919525] [2025-01-09 22:08:30,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:30,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:08:30,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:30,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:08:30,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:08:30,925 INFO L87 Difference]: Start difference. First operand 619 states and 681 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 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-01-09 22:08:30,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:30,995 INFO L93 Difference]: Finished difference Result 609 states and 668 transitions. [2025-01-09 22:08:30,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:08:30,996 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 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) Word has length 56 [2025-01-09 22:08:30,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:30,997 INFO L225 Difference]: With dead ends: 609 [2025-01-09 22:08:30,997 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 22:08:30,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:08:30,998 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:30,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:08:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 22:08:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 601. [2025-01-09 22:08:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 598 states have (on average 1.1036789297658862) internal successors, (660), 600 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 660 transitions. [2025-01-09 22:08:31,003 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 660 transitions. Word has length 56 [2025-01-09 22:08:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:31,003 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 660 transitions. [2025-01-09 22:08:31,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 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-01-09 22:08:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 660 transitions. [2025-01-09 22:08:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 22:08:31,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:31,003 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:31,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-01-09 22:08:31,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:31,204 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:31,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:31,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1529628132, now seen corresponding path program 8 times [2025-01-09 22:08:31,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:31,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645185951] [2025-01-09 22:08:31,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:08:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:31,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-01-09 22:08:31,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:08:31,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:08:31,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 35 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645185951] [2025-01-09 22:08:31,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645185951] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055924978] [2025-01-09 22:08:31,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:08:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:31,799 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:31,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-01-09 22:08:31,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-01-09 22:08:31,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:08:31,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:08:31,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:31,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-01-09 22:08:31,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:32,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:08:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 15 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:32,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:32,481 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 18 treesize of output 16 [2025-01-09 22:08:32,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:08:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 15 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:32,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055924978] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:32,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:32,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 22] total 43 [2025-01-09 22:08:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802043629] [2025-01-09 22:08:32,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:32,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 22:08:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:32,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 22:08:32,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 22:08:32,577 INFO L87 Difference]: Start difference. First operand 601 states and 660 transitions. Second operand has 43 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:34,655 INFO L93 Difference]: Finished difference Result 942 states and 1018 transitions. [2025-01-09 22:08:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-01-09 22:08:34,655 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 22:08:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:34,657 INFO L225 Difference]: With dead ends: 942 [2025-01-09 22:08:34,657 INFO L226 Difference]: Without dead ends: 843 [2025-01-09 22:08:34,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=357, Invalid=5805, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 22:08:34,658 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 162 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:34,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 2866 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 22:08:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-01-09 22:08:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 682. [2025-01-09 22:08:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 679 states have (on average 1.1030927835051547) internal successors, (749), 681 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 749 transitions. [2025-01-09 22:08:34,666 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 749 transitions. Word has length 57 [2025-01-09 22:08:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:34,666 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 749 transitions. [2025-01-09 22:08:34,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 749 transitions. [2025-01-09 22:08:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 22:08:34,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:34,667 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:34,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-01-09 22:08:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-01-09 22:08:34,867 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1892635968, now seen corresponding path program 5 times [2025-01-09 22:08:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:34,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296981040] [2025-01-09 22:08:34,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:08:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:34,888 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 60 statements into 9 equivalence classes. [2025-01-09 22:08:34,902 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:08:34,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-01-09 22:08:34,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 72 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296981040] [2025-01-09 22:08:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296981040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130862201] [2025-01-09 22:08:35,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:08:35,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:35,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:35,357 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:35,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-01-09 22:08:35,467 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 60 statements into 9 equivalence classes. [2025-01-09 22:08:35,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:08:35,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-01-09 22:08:35,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:35,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-01-09 22:08:35,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 70 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:35,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:35,981 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 23 treesize of output 19 [2025-01-09 22:08:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 70 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:36,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130862201] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:36,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:36,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2025-01-09 22:08:36,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627921071] [2025-01-09 22:08:36,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:36,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-09 22:08:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:36,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-09 22:08:36,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2288, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 22:08:36,197 INFO L87 Difference]: Start difference. First operand 682 states and 749 transitions. Second operand has 52 states, 51 states have (on average 2.9019607843137254) internal successors, (148), 52 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:36,726 INFO L93 Difference]: Finished difference Result 881 states and 956 transitions. [2025-01-09 22:08:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:08:36,726 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.9019607843137254) internal successors, (148), 52 states have internal predecessors, (148), 0 states have call successors, (0), 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-01-09 22:08:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:36,727 INFO L225 Difference]: With dead ends: 881 [2025-01-09 22:08:36,728 INFO L226 Difference]: Without dead ends: 861 [2025-01-09 22:08:36,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=2362, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 22:08:36,728 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 279 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:36,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1563 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:08:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-01-09 22:08:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 668. [2025-01-09 22:08:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 665 states have (on average 1.105263157894737) internal successors, (735), 667 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 735 transitions. [2025-01-09 22:08:36,733 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 735 transitions. Word has length 60 [2025-01-09 22:08:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:36,733 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 735 transitions. [2025-01-09 22:08:36,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.9019607843137254) internal successors, (148), 52 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 735 transitions. [2025-01-09 22:08:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 22:08:36,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:36,734 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:36,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-01-09 22:08:36,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,32 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:36,938 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:36,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1359101351, now seen corresponding path program 3 times [2025-01-09 22:08:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529272176] [2025-01-09 22:08:36,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:36,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 5 equivalence classes. [2025-01-09 22:08:36,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:08:36,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 22:08:36,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 53 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:08:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529272176] [2025-01-09 22:08:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529272176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115528320] [2025-01-09 22:08:37,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:37,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:37,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:37,377 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:37,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-01-09 22:08:37,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 5 equivalence classes. [2025-01-09 22:08:37,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:08:37,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 22:08:37,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:37,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 22:08:37,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:37,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:08:37,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 7 [2025-01-09 22:08:37,587 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-01-09 22:08:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:38,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:39,164 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:08:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:08:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115528320] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:39,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:39,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 55 [2025-01-09 22:08:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031356255] [2025-01-09 22:08:39,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:39,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-09 22:08:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:39,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-09 22:08:39,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2627, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 22:08:39,238 INFO L87 Difference]: Start difference. First operand 668 states and 735 transitions. Second operand has 56 states, 55 states have (on average 3.109090909090909) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:40,812 INFO L93 Difference]: Finished difference Result 1029 states and 1098 transitions. [2025-01-09 22:08:40,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-09 22:08:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 3.109090909090909) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 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 61 [2025-01-09 22:08:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:40,814 INFO L225 Difference]: With dead ends: 1029 [2025-01-09 22:08:40,814 INFO L226 Difference]: Without dead ends: 696 [2025-01-09 22:08:40,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1098, Invalid=6212, Unknown=0, NotChecked=0, Total=7310 [2025-01-09 22:08:40,815 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 175 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:40,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 921 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:08:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-01-09 22:08:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 606. [2025-01-09 22:08:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 603 states have (on average 1.086235489220564) internal successors, (655), 605 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 655 transitions. [2025-01-09 22:08:40,820 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 655 transitions. Word has length 61 [2025-01-09 22:08:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:40,820 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 655 transitions. [2025-01-09 22:08:40,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 3.109090909090909) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 655 transitions. [2025-01-09 22:08:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 22:08:40,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:40,821 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:40,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-01-09 22:08:41,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-01-09 22:08:41,026 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:41,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 251840534, now seen corresponding path program 9 times [2025-01-09 22:08:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611779684] [2025-01-09 22:08:41,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:41,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 10 equivalence classes. [2025-01-09 22:08:41,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:08:41,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-09 22:08:41,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 51 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:41,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:41,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611779684] [2025-01-09 22:08:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611779684] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44285299] [2025-01-09 22:08:41,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:08:41,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:41,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:41,723 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:41,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-01-09 22:08:41,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 10 equivalence classes. [2025-01-09 22:08:41,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:08:41,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-09 22:08:41,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:41,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-01-09 22:08:41,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:42,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:08:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 17 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:42,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:42,457 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 18 treesize of output 16 [2025-01-09 22:08:42,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:08:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 17 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44285299] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:42,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 48 [2025-01-09 22:08:42,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368079593] [2025-01-09 22:08:42,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:42,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:08:42,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:42,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:08:42,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2094, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:08:42,553 INFO L87 Difference]: Start difference. First operand 606 states and 655 transitions. Second operand has 48 states, 48 states have (on average 2.625) internal successors, (126), 48 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:44,595 INFO L93 Difference]: Finished difference Result 943 states and 1006 transitions. [2025-01-09 22:08:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-01-09 22:08:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.625) internal successors, (126), 48 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 22:08:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:44,597 INFO L225 Difference]: With dead ends: 943 [2025-01-09 22:08:44,597 INFO L226 Difference]: Without dead ends: 835 [2025-01-09 22:08:44,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=623, Invalid=8307, Unknown=0, NotChecked=0, Total=8930 [2025-01-09 22:08:44,598 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 201 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:44,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1719 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:08:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-01-09 22:08:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 696. [2025-01-09 22:08:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 693 states have (on average 1.0836940836940836) internal successors, (751), 695 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 751 transitions. [2025-01-09 22:08:44,602 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 751 transitions. Word has length 63 [2025-01-09 22:08:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:44,602 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 751 transitions. [2025-01-09 22:08:44,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.625) internal successors, (126), 48 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 751 transitions. [2025-01-09 22:08:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 22:08:44,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:44,607 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:44,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-01-09 22:08:44,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,34 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:44,807 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:44,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1719791970, now seen corresponding path program 7 times [2025-01-09 22:08:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802549253] [2025-01-09 22:08:44,808 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 22:08:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:44,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:08:44,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:08:44,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:08:44,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 22 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:45,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802549253] [2025-01-09 22:08:45,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802549253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466920607] [2025-01-09 22:08:45,371 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 22:08:45,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:45,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:45,373 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:45,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-01-09 22:08:45,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:08:45,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:08:45,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:08:45,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:45,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-01-09 22:08:45,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:45,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:08:45,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:08:45,548 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-01-09 22:08:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:46,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:08:47,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466920607] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:47,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:47,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 22] total 61 [2025-01-09 22:08:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430996119] [2025-01-09 22:08:47,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:47,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-09 22:08:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:47,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-09 22:08:47,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=3390, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 22:08:47,468 INFO L87 Difference]: Start difference. First operand 696 states and 751 transitions. Second operand has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:49,738 INFO L93 Difference]: Finished difference Result 978 states and 1039 transitions. [2025-01-09 22:08:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 22:08:49,739 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 22:08:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:49,741 INFO L225 Difference]: With dead ends: 978 [2025-01-09 22:08:49,741 INFO L226 Difference]: Without dead ends: 920 [2025-01-09 22:08:49,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1067, Invalid=8635, Unknown=0, NotChecked=0, Total=9702 [2025-01-09 22:08:49,742 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 237 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:49,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1305 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 22:08:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-01-09 22:08:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 738. [2025-01-09 22:08:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 735 states have (on average 1.0775510204081633) internal successors, (792), 737 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 792 transitions. [2025-01-09 22:08:49,759 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 792 transitions. Word has length 63 [2025-01-09 22:08:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:49,759 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 792 transitions. [2025-01-09 22:08:49,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 792 transitions. [2025-01-09 22:08:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 22:08:49,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:49,760 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:49,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-01-09 22:08:49,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,35 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:49,962 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:49,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash 601057072, now seen corresponding path program 4 times [2025-01-09 22:08:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:49,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846698525] [2025-01-09 22:08:49,963 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:08:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:49,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-01-09 22:08:49,990 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:08:49,993 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:08:49,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 41 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:08:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846698525] [2025-01-09 22:08:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846698525] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121693325] [2025-01-09 22:08:50,710 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:08:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:50,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:50,712 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:50,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-01-09 22:08:50,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-01-09 22:08:50,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 22:08:50,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:08:50,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:50,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-01-09 22:08:50,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:50,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:08:50,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:08:50,940 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-01-09 22:08:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 5 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:52,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:53,882 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:08:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:53,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121693325] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:54,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 25] total 71 [2025-01-09 22:08:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862165249] [2025-01-09 22:08:54,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:54,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-01-09 22:08:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:54,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-01-09 22:08:54,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=4597, Unknown=0, NotChecked=0, Total=5112 [2025-01-09 22:08:54,001 INFO L87 Difference]: Start difference. First operand 738 states and 792 transitions. Second operand has 72 states, 71 states have (on average 2.6338028169014085) internal successors, (187), 72 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:56,559 INFO L93 Difference]: Finished difference Result 868 states and 924 transitions. [2025-01-09 22:08:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-09 22:08:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.6338028169014085) internal successors, (187), 72 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 22:08:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:56,561 INFO L225 Difference]: With dead ends: 868 [2025-01-09 22:08:56,561 INFO L226 Difference]: Without dead ends: 827 [2025-01-09 22:08:56,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4214 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1529, Invalid=11811, Unknown=0, NotChecked=0, Total=13340 [2025-01-09 22:08:56,562 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 237 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:56,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 744 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 22:08:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-09 22:08:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 732. [2025-01-09 22:08:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 729 states have (on average 1.0768175582990398) internal successors, (785), 731 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 785 transitions. [2025-01-09 22:08:56,578 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 785 transitions. Word has length 65 [2025-01-09 22:08:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:56,578 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 785 transitions. [2025-01-09 22:08:56,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.6338028169014085) internal successors, (187), 72 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 785 transitions. [2025-01-09 22:08:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:08:56,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:56,579 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:56,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-01-09 22:08:56,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-01-09 22:08:56,780 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:56,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1794697230, now seen corresponding path program 6 times [2025-01-09 22:08:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:56,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629975250] [2025-01-09 22:08:56,780 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:08:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:56,791 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 10 equivalence classes. [2025-01-09 22:08:56,819 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:08:56,822 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-01-09 22:08:56,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 70 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:57,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:57,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629975250] [2025-01-09 22:08:57,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629975250] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:57,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104235762] [2025-01-09 22:08:57,526 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:08:57,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:57,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:57,528 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:08:57,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-01-09 22:08:57,656 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 10 equivalence classes. [2025-01-09 22:08:57,758 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:08:57,758 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-01-09 22:08:57,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:57,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-09 22:08:57,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 92 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:58,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:58,538 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 8 treesize of output 6 [2025-01-09 22:08:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 92 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:08:58,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104235762] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:58,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:58,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 51 [2025-01-09 22:08:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702593477] [2025-01-09 22:08:58,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:58,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-09 22:08:58,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:58,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-09 22:08:58,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2323, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 22:08:58,730 INFO L87 Difference]: Start difference. First operand 732 states and 785 transitions. Second operand has 52 states, 51 states have (on average 2.764705882352941) internal successors, (141), 52 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:59,578 INFO L93 Difference]: Finished difference Result 1032 states and 1101 transitions. [2025-01-09 22:08:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 22:08:59,579 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.764705882352941) internal successors, (141), 52 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 22:08:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:59,580 INFO L225 Difference]: With dead ends: 1032 [2025-01-09 22:08:59,580 INFO L226 Difference]: Without dead ends: 943 [2025-01-09 22:08:59,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 95 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=767, Invalid=4635, Unknown=0, NotChecked=0, Total=5402 [2025-01-09 22:08:59,581 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 240 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:59,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 807 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:08:59,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-01-09 22:08:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 756. [2025-01-09 22:08:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 753 states have (on average 1.0770252324037184) internal successors, (811), 755 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 811 transitions. [2025-01-09 22:08:59,586 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 811 transitions. Word has length 66 [2025-01-09 22:08:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:59,586 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 811 transitions. [2025-01-09 22:08:59,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.764705882352941) internal successors, (141), 52 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 811 transitions. [2025-01-09 22:08:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:08:59,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:59,587 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:59,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-01-09 22:08:59,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-01-09 22:08:59,791 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:08:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1389202289, now seen corresponding path program 5 times [2025-01-09 22:08:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632461118] [2025-01-09 22:08:59,793 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:08:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:59,801 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 5 equivalence classes. [2025-01-09 22:08:59,813 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:08:59,813 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 22:08:59,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:09:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:09:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:09:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632461118] [2025-01-09 22:09:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632461118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:09:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561316258] [2025-01-09 22:09:00,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:09:00,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:09:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:09:00,149 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:09:00,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-01-09 22:09:00,268 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 5 equivalence classes. [2025-01-09 22:09:00,346 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:09:00,346 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 22:09:00,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:09:00,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 22:09:00,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:09:00,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:09:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:09:00,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:09:00,688 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-01-09 22:09:00,689 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-01-09 22:09:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 31 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:09:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561316258] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:09:00,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:09:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 41 [2025-01-09 22:09:00,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814912581] [2025-01-09 22:09:00,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:09:00,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 22:09:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:09:00,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 22:09:00,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1462, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 22:09:00,916 INFO L87 Difference]: Start difference. First operand 756 states and 811 transitions. Second operand has 41 states, 41 states have (on average 3.4634146341463414) internal successors, (142), 41 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:09:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:09:01,564 INFO L93 Difference]: Finished difference Result 779 states and 831 transitions. [2025-01-09 22:09:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:09:01,564 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.4634146341463414) internal successors, (142), 41 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 22:09:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:09:01,565 INFO L225 Difference]: With dead ends: 779 [2025-01-09 22:09:01,565 INFO L226 Difference]: Without dead ends: 707 [2025-01-09 22:09:01,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=393, Invalid=3389, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 22:09:01,566 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:09:01,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 423 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:09:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-01-09 22:09:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 706. [2025-01-09 22:09:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 703 states have (on average 1.0768136557610242) internal successors, (757), 705 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:09:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 757 transitions. [2025-01-09 22:09:01,570 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 757 transitions. Word has length 66 [2025-01-09 22:09:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:09:01,570 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 757 transitions. [2025-01-09 22:09:01,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.4634146341463414) internal successors, (142), 41 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:09:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 757 transitions. [2025-01-09 22:09:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 22:09:01,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:09:01,571 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:09:01,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-01-09 22:09:01,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,38 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:09:01,775 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:09:01,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:09:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1695385153, now seen corresponding path program 8 times [2025-01-09 22:09:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:09:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111601234] [2025-01-09 22:09:01,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:09:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:09:01,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-01-09 22:09:01,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 22:09:01,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:09:01,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:09:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 84 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:09:02,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:09:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111601234] [2025-01-09 22:09:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111601234] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:09:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899970747] [2025-01-09 22:09:02,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:09:02,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:09:02,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:09:02,432 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:09:02,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-01-09 22:09:02,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-01-09 22:09:02,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 22:09:02,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:09:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:09:02,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-01-09 22:09:02,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:09:02,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:09:02,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:09:02,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-09 22:09:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:09:03,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:09:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:09:04,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899970747] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:09:04,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:09:04,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 58 [2025-01-09 22:09:04,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725342575] [2025-01-09 22:09:04,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:09:04,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-01-09 22:09:04,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:09:04,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-01-09 22:09:04,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3085, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 22:09:04,075 INFO L87 Difference]: Start difference. First operand 706 states and 757 transitions. Second operand has 59 states, 58 states have (on average 3.086206896551724) internal successors, (179), 59 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:09:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:09:05,626 INFO L93 Difference]: Finished difference Result 958 states and 1022 transitions. [2025-01-09 22:09:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 22:09:05,626 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 3.086206896551724) internal successors, (179), 59 states have internal predecessors, (179), 0 states have call successors, (0), 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-01-09 22:09:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:09:05,628 INFO L225 Difference]: With dead ends: 958 [2025-01-09 22:09:05,628 INFO L226 Difference]: Without dead ends: 916 [2025-01-09 22:09:05,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=920, Invalid=8200, Unknown=0, NotChecked=0, Total=9120 [2025-01-09 22:09:05,629 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 153 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:09:05,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 697 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:09:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-01-09 22:09:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 688. [2025-01-09 22:09:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 685 states have (on average 1.0773722627737226) internal successors, (738), 687 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:09:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 738 transitions. [2025-01-09 22:09:05,636 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 738 transitions. Word has length 67 [2025-01-09 22:09:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:09:05,636 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 738 transitions. [2025-01-09 22:09:05,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.086206896551724) internal successors, (179), 59 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:09:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 738 transitions. [2025-01-09 22:09:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 22:09:05,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:09:05,636 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:09:05,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-01-09 22:09:05,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,39 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:09:05,837 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-09 22:09:05,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:09:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1571655516, now seen corresponding path program 9 times [2025-01-09 22:09:05,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:09:05,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562216689] [2025-01-09 22:09:05,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:09:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:09:05,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 8 equivalence classes. [2025-01-09 22:09:05,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 22:09:05,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 22:09:05,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:09:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 35 proven. 115 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:09:06,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:09:06,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562216689] [2025-01-09 22:09:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562216689] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:09:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981379684] [2025-01-09 22:09:06,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:09:06,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:09:06,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:09:06,451 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:09:06,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-01-09 22:09:06,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 8 equivalence classes. [2025-01-09 22:09:06,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 22:09:06,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 22:09:06,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:09:06,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-01-09 22:09:06,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:09:06,658 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-01-09 22:09:06,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-01-09 22:09:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:09:07,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:09:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:09:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981379684] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:09:08,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:09:08,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 23] total 68 [2025-01-09 22:09:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382440308] [2025-01-09 22:09:08,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:09:08,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-01-09 22:09:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:09:08,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-01-09 22:09:08,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=4245, Unknown=0, NotChecked=0, Total=4692 [2025-01-09 22:09:08,435 INFO L87 Difference]: Start difference. First operand 688 states and 738 transitions. Second operand has 69 states, 68 states have (on average 2.911764705882353) internal successors, (198), 69 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)