./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:24:02,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:24:02,794 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:24:02,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:24:02,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:24:02,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:24:02,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:24:02,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:24:02,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:24:02,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:24:02,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:24:02,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:24:02,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:24:02,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:24:02,827 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:24:02,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:24:02,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:24:02,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:24:02,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:24:02,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:24:02,828 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:24:02,828 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:24:02,829 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:24:02,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:24:02,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:24:02,829 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:24:02,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:24:02,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:24:02,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:24:02,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:24:02,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:24:02,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:24:02,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:24:02,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:24:02,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:24:02,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:24:02,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:24:02,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:24:02,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:24:02,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:24:02,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:24:02,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:24:02,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:24:02,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:24:02,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:24:02,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:24:02,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:24:02,832 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 -> 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 [2025-01-09 22:24:03,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:24:03,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:24:03,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:24:03,131 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:24:03,131 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:24:03,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2025-01-09 22:24:04,412 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a10947212/206c725a468040b39d8313767373b410/FLAG89a12820e [2025-01-09 22:24:04,671 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:24:04,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2025-01-09 22:24:04,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a10947212/206c725a468040b39d8313767373b410/FLAG89a12820e [2025-01-09 22:24:04,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a10947212/206c725a468040b39d8313767373b410 [2025-01-09 22:24:04,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:24:04,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:24:04,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:24:04,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:24:04,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:24:04,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:04,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406f88c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04, skipping insertion in model container [2025-01-09 22:24:04,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:04,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:24:04,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:24:04,915 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:24:04,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:24:04,950 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:24:04,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04 WrapperNode [2025-01-09 22:24:04,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:24:04,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:24:04,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:24:04,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:24:04,959 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:24:04" (1/1) ... [2025-01-09 22:24:04,967 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:24:04" (1/1) ... [2025-01-09 22:24:04,986 INFO L138 Inliner]: procedures = 9, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-01-09 22:24:04,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:24:04,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:24:04,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:24:04,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:24:04,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:04,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,019 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-01-09 22:24:05,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:24:05,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:24:05,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:24:05,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:24:05,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (1/1) ... [2025-01-09 22:24:05,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:24:05,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:05,077 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:24:05,080 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:24:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:24:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:24:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:24:05,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:24:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:24:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:24:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:24:05,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:24:05,163 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:24:05,165 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:24:05,402 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-01-09 22:24:05,402 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:24:05,414 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:24:05,414 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:24:05,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:24:05 BoogieIcfgContainer [2025-01-09 22:24:05,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:24:05,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:24:05,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:24:05,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:24:05,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:24:04" (1/3) ... [2025-01-09 22:24:05,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19842200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:24:05, skipping insertion in model container [2025-01-09 22:24:05,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:04" (2/3) ... [2025-01-09 22:24:05,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19842200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:24:05, skipping insertion in model container [2025-01-09 22:24:05,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:24:05" (3/3) ... [2025-01-09 22:24:05,427 INFO L128 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2025-01-09 22:24:05,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:24:05,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ArraysOfVariableLength2.c that has 1 procedures, 33 locations, 1 initial locations, 4 loop locations, and 11 error locations. [2025-01-09 22:24:05,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:24:05,500 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;@2dbb8aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:24:05,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 22:24:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:24:05,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:05,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:24:05,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:05,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash 28694821, now seen corresponding path program 1 times [2025-01-09 22:24:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364144437] [2025-01-09 22:24:05,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:05,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:24:05,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:24:05,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:05,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:05,761 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:24:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364144437] [2025-01-09 22:24:05,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364144437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:05,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:05,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:24:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662344265] [2025-01-09 22:24:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:05,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:05,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:05,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:05,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:05,792 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:05,906 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-01-09 22:24:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:24:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:05,914 INFO L225 Difference]: With dead ends: 46 [2025-01-09 22:24:05,914 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 22:24:05,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:05,918 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:05,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 22:24:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2025-01-09 22:24:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-01-09 22:24:05,951 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 5 [2025-01-09 22:24:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:05,952 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-01-09 22:24:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-01-09 22:24:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:24:05,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:05,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:24:05,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:24:05,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:05,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash 889548466, now seen corresponding path program 1 times [2025-01-09 22:24:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601006030] [2025-01-09 22:24:05,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:05,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:24:05,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:24:05,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:05,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:06,110 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:24:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601006030] [2025-01-09 22:24:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601006030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:06,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:24:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701535099] [2025-01-09 22:24:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:06,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:06,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:06,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:06,112 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:06,207 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-01-09 22:24:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:06,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:24:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:06,208 INFO L225 Difference]: With dead ends: 41 [2025-01-09 22:24:06,208 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 22:24:06,208 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:24:06,209 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:06,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 22:24:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2025-01-09 22:24:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-01-09 22:24:06,218 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 6 [2025-01-09 22:24:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:06,219 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-01-09 22:24:06,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-01-09 22:24:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:24:06,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:06,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:06,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:24:06,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:06,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash 595888050, now seen corresponding path program 1 times [2025-01-09 22:24:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:06,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967219054] [2025-01-09 22:24:06,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:06,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:24:06,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:24:06,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:06,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:06,307 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:24:06,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967219054] [2025-01-09 22:24:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967219054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:06,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:24:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641954787] [2025-01-09 22:24:06,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:06,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:06,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:06,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:06,309 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:24:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:06,345 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-01-09 22:24:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:06,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:24:06,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:06,348 INFO L225 Difference]: With dead ends: 41 [2025-01-09 22:24:06,348 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 22:24:06,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:06,349 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:06,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 22:24:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-01-09 22:24:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 36 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:24:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-01-09 22:24:06,353 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 9 [2025-01-09 22:24:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:06,353 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-09 22:24:06,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:24:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-01-09 22:24:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:24:06,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:06,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:06,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:24:06,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:06,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash 595889972, now seen corresponding path program 1 times [2025-01-09 22:24:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:06,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841866932] [2025-01-09 22:24:06,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:06,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:06,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:24:06,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:24:06,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:06,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:06,541 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:24:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:06,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841866932] [2025-01-09 22:24:06,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841866932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:06,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:06,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:06,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14030624] [2025-01-09 22:24:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:06,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:06,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:06,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:06,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:06,543 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:06,590 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-01-09 22:24:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:24:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:06,592 INFO L225 Difference]: With dead ends: 35 [2025-01-09 22:24:06,594 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 22:24:06,594 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:24:06,595 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:06,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 22 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 22:24:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 22:24:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 34 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:24:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-09 22:24:06,602 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 9 [2025-01-09 22:24:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:06,603 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-09 22:24:06,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-09 22:24:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:24:06,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:06,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:06,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:24:06,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:06,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:06,605 INFO L85 PathProgramCache]: Analyzing trace with hash 595889973, now seen corresponding path program 1 times [2025-01-09 22:24:06,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:06,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789136556] [2025-01-09 22:24:06,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:06,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:06,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:24:06,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:24:06,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:06,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:06,813 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:24:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789136556] [2025-01-09 22:24:06,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789136556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:06,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:06,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:24:06,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320592840] [2025-01-09 22:24:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:06,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:06,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:06,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:06,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:06,814 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:24:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:06,881 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-01-09 22:24:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:06,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:24:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:06,883 INFO L225 Difference]: With dead ends: 40 [2025-01-09 22:24:06,884 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 22:24:06,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:06,885 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:06,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 22:24:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-01-09 22:24:06,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-01-09 22:24:06,893 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 9 [2025-01-09 22:24:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:06,893 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-01-09 22:24:06,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:24:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-01-09 22:24:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:24:06,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:06,895 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:06,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:24:06,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:06,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1551438575, now seen corresponding path program 1 times [2025-01-09 22:24:06,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:06,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564635745] [2025-01-09 22:24:06,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:06,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:06,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:24:06,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:24:06,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:06,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:07,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:07,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564635745] [2025-01-09 22:24:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564635745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:07,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:07,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:07,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231363894] [2025-01-09 22:24:07,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:07,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:07,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:07,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:07,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:07,004 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:24:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:07,052 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-01-09 22:24:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:07,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:24:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:07,053 INFO L225 Difference]: With dead ends: 38 [2025-01-09 22:24:07,054 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 22:24:07,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:07,055 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:07,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 22:24:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 22:24:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 37 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:24:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-01-09 22:24:07,060 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 13 [2025-01-09 22:24:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:07,060 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-01-09 22:24:07,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:24:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-01-09 22:24:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:24:07,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:07,061 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:07,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:24:07,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:07,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1551438574, now seen corresponding path program 1 times [2025-01-09 22:24:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:07,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242151041] [2025-01-09 22:24:07,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:07,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:24:07,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:24:07,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:07,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:07,285 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:24:07,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242151041] [2025-01-09 22:24:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242151041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130184123] [2025-01-09 22:24:07,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:07,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:07,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:07,291 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:24:07,292 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:24:07,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:24:07,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:24:07,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:07,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:07,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:24:07,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:07,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:07,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:24:07,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:07,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:24:07,557 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:24:07,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:07,721 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 52 treesize of output 48 [2025-01-09 22:24:07,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:24:07,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2025-01-09 22:24:07,853 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:24:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130184123] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:07,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:07,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-01-09 22:24:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589630703] [2025-01-09 22:24:07,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:07,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:24:07,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:07,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:24:07,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:24:07,856 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:08,256 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2025-01-09 22:24:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:24:08,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:24:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:08,259 INFO L225 Difference]: With dead ends: 93 [2025-01-09 22:24:08,261 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 22:24:08,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:24:08,262 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 259 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:08,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 49 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 22:24:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 45. [2025-01-09 22:24:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:24:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-01-09 22:24:08,272 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 13 [2025-01-09 22:24:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:08,272 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-01-09 22:24:08,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-01-09 22:24:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:24:08,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:08,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:08,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:08,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:08,474 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:08,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash -849946554, now seen corresponding path program 1 times [2025-01-09 22:24:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:08,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989746747] [2025-01-09 22:24:08,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:08,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:08,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:24:08,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:24:08,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:08,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:08,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989746747] [2025-01-09 22:24:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989746747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:08,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299616346] [2025-01-09 22:24:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:08,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:08,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:08,568 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:08,611 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-01-09 22:24:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:08,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:24:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:08,613 INFO L225 Difference]: With dead ends: 43 [2025-01-09 22:24:08,613 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 22:24:08,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:08,614 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:08,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 22:24:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 22:24:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-01-09 22:24:08,620 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 14 [2025-01-09 22:24:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:08,622 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-01-09 22:24:08,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-01-09 22:24:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:24:08,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:08,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:08,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:24:08,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:08,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -849946553, now seen corresponding path program 1 times [2025-01-09 22:24:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858836672] [2025-01-09 22:24:08,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:08,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:24:08,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:24:08,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:08,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:08,716 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:24:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858836672] [2025-01-09 22:24:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858836672] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978562086] [2025-01-09 22:24:08,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:08,719 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:24:08,722 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:24:08,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:24:08,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:24:08,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:08,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:08,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:24:08,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:08,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978562086] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:08,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 22:24:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242693330] [2025-01-09 22:24:08,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:08,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:24:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:08,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:24:08,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:24:08,893 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:08,986 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-01-09 22:24:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:24:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:24:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:08,988 INFO L225 Difference]: With dead ends: 45 [2025-01-09 22:24:08,988 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 22:24:08,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:24:08,990 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:08,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 64 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:08,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 22:24:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-01-09 22:24:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-01-09 22:24:08,994 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 14 [2025-01-09 22:24:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-01-09 22:24:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-01-09 22:24:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:24:08,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:08,995 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:09,003 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:24:09,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:09,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:09,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash -849955584, now seen corresponding path program 1 times [2025-01-09 22:24:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:09,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621266951] [2025-01-09 22:24:09,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:09,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:24:09,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:24:09,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:09,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:09,352 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:24:09,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621266951] [2025-01-09 22:24:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621266951] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953931509] [2025-01-09 22:24:09,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:09,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:09,355 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:24:09,357 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:24:09,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:24:09,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:24:09,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:09,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:09,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:24:09,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:09,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:24:09,464 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:24:09,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:09,541 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:24:09,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953931509] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:09,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:09,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 22:24:09,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644622948] [2025-01-09 22:24:09,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:09,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:24:09,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:09,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:24:09,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:24:09,543 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:09,764 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2025-01-09 22:24:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:24:09,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:24:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:09,765 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:24:09,765 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:24:09,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:24:09,766 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 87 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:09,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 107 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:24:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2025-01-09 22:24:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 80 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:24:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2025-01-09 22:24:09,771 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 14 [2025-01-09 22:24:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:09,771 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2025-01-09 22:24:09,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2025-01-09 22:24:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:24:09,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:09,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:09,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:09,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:09,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2100331350, now seen corresponding path program 1 times [2025-01-09 22:24:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027375971] [2025-01-09 22:24:09,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:09,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:24:09,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:24:09,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:09,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:10,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:10,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027375971] [2025-01-09 22:24:10,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027375971] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:10,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488561434] [2025-01-09 22:24:10,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:10,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:10,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:10,066 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:24:10,067 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:24:10,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:24:10,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:24:10,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:10,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:10,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:24:10,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:10,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488561434] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:10,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:10,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 22:24:10,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021553465] [2025-01-09 22:24:10,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:10,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:24:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:10,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:24:10,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:24:10,237 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:10,349 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2025-01-09 22:24:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:24:10,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 22:24:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:10,350 INFO L225 Difference]: With dead ends: 80 [2025-01-09 22:24:10,350 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 22:24:10,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:24:10,351 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:10,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 90 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 22:24:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2025-01-09 22:24:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.356164383561644) internal successors, (99), 78 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:24:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2025-01-09 22:24:10,355 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 17 [2025-01-09 22:24:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:10,355 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2025-01-09 22:24:10,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2025-01-09 22:24:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:24:10,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:10,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:10,363 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:24:10,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 22:24:10,556 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:10,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash 685771395, now seen corresponding path program 1 times [2025-01-09 22:24:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99955532] [2025-01-09 22:24:10,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:10,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:24:10,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:24:10,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:10,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:10,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99955532] [2025-01-09 22:24:10,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99955532] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573580347] [2025-01-09 22:24:10,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:10,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:10,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:10,721 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:24:10,723 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:24:10,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:24:10,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:24:10,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:10,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:10,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 22:24:10,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:10,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:10,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-09 22:24:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:10,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573580347] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:10,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-09 22:24:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318940748] [2025-01-09 22:24:10,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:10,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:24:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:10,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:24:10,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:24:10,954 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:11,064 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2025-01-09 22:24:11,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:24:11,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:24:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:11,065 INFO L225 Difference]: With dead ends: 88 [2025-01-09 22:24:11,065 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 22:24:11,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:24:11,066 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:11,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 94 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 22:24:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2025-01-09 22:24:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 81 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:24:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2025-01-09 22:24:11,075 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 18 [2025-01-09 22:24:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:11,075 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-01-09 22:24:11,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2025-01-09 22:24:11,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:24:11,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:11,076 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:24:11,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:24:11,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 22:24:11,277 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:11,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1343831523, now seen corresponding path program 1 times [2025-01-09 22:24:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:11,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574201553] [2025-01-09 22:24:11,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:11,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:24:11,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:24:11,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:11,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574201553] [2025-01-09 22:24:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574201553] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262232309] [2025-01-09 22:24:11,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:11,367 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:24:11,369 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:24:11,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:24:11,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:24:11,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:11,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:11,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:24:11,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:11,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:11,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262232309] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:11,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-09 22:24:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373913158] [2025-01-09 22:24:11,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:11,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:24:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:11,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:24:11,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:24:11,551 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:11,665 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2025-01-09 22:24:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:24:11,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 22:24:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:11,666 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:24:11,666 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:24:11,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:24:11,667 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:11,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 92 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:24:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-01-09 22:24:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.32) internal successors, (99), 80 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:24:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2025-01-09 22:24:11,670 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 21 [2025-01-09 22:24:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:11,670 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2025-01-09 22:24:11,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2025-01-09 22:24:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:24:11,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:11,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:11,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:24:11,871 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,SelfDestructingSolverStorable12 [2025-01-09 22:24:11,871 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:11,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1338072731, now seen corresponding path program 1 times [2025-01-09 22:24:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443906794] [2025-01-09 22:24:11,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:11,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:24:11,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:24:11,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:11,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443906794] [2025-01-09 22:24:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443906794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762846029] [2025-01-09 22:24:11,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:11,975 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:24:11,977 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:24:12,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:24:12,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:24:12,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:12,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:12,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:24:12,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:12,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762846029] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:12,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 22:24:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414652859] [2025-01-09 22:24:12,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:12,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:24:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:12,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:24:12,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:24:12,145 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:12,237 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2025-01-09 22:24:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:24:12,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 22:24:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:12,238 INFO L225 Difference]: With dead ends: 80 [2025-01-09 22:24:12,238 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 22:24:12,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:24:12,239 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:12,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 75 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 22:24:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2025-01-09 22:24:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 74 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2025-01-09 22:24:12,241 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 21 [2025-01-09 22:24:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:12,245 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2025-01-09 22:24:12,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2025-01-09 22:24:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:24:12,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:12,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:12,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:24:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:12,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:12,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash -689011703, now seen corresponding path program 1 times [2025-01-09 22:24:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898376769] [2025-01-09 22:24:12,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:12,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:24:12,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:24:12,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:12,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898376769] [2025-01-09 22:24:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898376769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132479387] [2025-01-09 22:24:12,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:12,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:12,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:12,731 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:24:12,733 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:24:12,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:24:12,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:24:12,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:12,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:12,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 22:24:12,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:12,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:24:12,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:24:12,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:12,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:24:12,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:12,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:24:13,012 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:24:13,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:24:13,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:13,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:24:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:13,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:13,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:24:13,353 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 43 treesize of output 61 [2025-01-09 22:24:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132479387] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:13,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 17 [2025-01-09 22:24:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797224199] [2025-01-09 22:24:13,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:13,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:24:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:13,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:24:13,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:24:13,488 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 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:24:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:13,903 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2025-01-09 22:24:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:24:13,903 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 22:24:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:13,904 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:24:13,904 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:24:13,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:24:13,905 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 104 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:13,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 107 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:24:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:24:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2025-01-09 22:24:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 89 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:24:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2025-01-09 22:24:13,911 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 24 [2025-01-09 22:24:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:13,911 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2025-01-09 22:24:13,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 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:24:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2025-01-09 22:24:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:24:13,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:13,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:13,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:14,118 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,SelfDestructingSolverStorable14 [2025-01-09 22:24:14,118 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:14,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash -192746676, now seen corresponding path program 1 times [2025-01-09 22:24:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666742351] [2025-01-09 22:24:14,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:14,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:24:14,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:24:14,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:14,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:24:14,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:14,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666742351] [2025-01-09 22:24:14,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666742351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:14,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:24:14,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535884801] [2025-01-09 22:24:14,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:14,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:14,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:14,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:14,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:14,235 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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:24:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:14,259 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2025-01-09 22:24:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 28 [2025-01-09 22:24:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:14,260 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:24:14,260 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:24:14,260 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:24:14,261 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:14,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:24:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-01-09 22:24:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 86 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:24:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-01-09 22:24:14,265 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 28 [2025-01-09 22:24:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:14,265 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-01-09 22:24:14,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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:24:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-01-09 22:24:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:24:14,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:14,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:14,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:24:14,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:14,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash 255044146, now seen corresponding path program 1 times [2025-01-09 22:24:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:14,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568912364] [2025-01-09 22:24:14,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:14,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:24:14,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:24:14,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:14,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:14,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:14,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568912364] [2025-01-09 22:24:14,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568912364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:14,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20540301] [2025-01-09 22:24:14,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:14,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:14,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:14,351 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:24:14,354 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:24:14,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:24:14,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:24:14,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:14,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:14,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:24:14,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:14,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20540301] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:14,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 22:24:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566870172] [2025-01-09 22:24:14,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:14,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:24:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:14,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:24:14,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:24:14,546 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:14,590 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2025-01-09 22:24:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:24:14,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 22:24:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:14,592 INFO L225 Difference]: With dead ends: 115 [2025-01-09 22:24:14,593 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 22:24:14,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:24:14,593 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 74 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:14,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 101 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 22:24:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2025-01-09 22:24:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 105 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:24:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2025-01-09 22:24:14,597 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 31 [2025-01-09 22:24:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2025-01-09 22:24:14,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2025-01-09 22:24:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:24:14,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:14,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:14,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:14,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:14,800 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:14,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1173199830, now seen corresponding path program 1 times [2025-01-09 22:24:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:14,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201817605] [2025-01-09 22:24:14,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:14,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:24:14,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:24:14,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:14,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:15,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:15,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201817605] [2025-01-09 22:24:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201817605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:15,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032487647] [2025-01-09 22:24:15,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:15,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:15,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:15,135 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:24:15,137 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:24:15,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:24:15,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:24:15,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:15,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:15,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:24:15,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:15,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:15,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:24:15,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:15,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:24:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:15,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:15,609 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 52 treesize of output 48 [2025-01-09 22:24:15,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:24:15,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2025-01-09 22:24:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:15,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032487647] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:15,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:15,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-01-09 22:24:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84564724] [2025-01-09 22:24:15,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:15,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:24:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:15,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:24:15,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:24:15,791 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 18 states, 17 states have (on average 5.529411764705882) internal successors, (94), 18 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:16,155 INFO L93 Difference]: Finished difference Result 161 states and 206 transitions. [2025-01-09 22:24:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:24:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.529411764705882) internal successors, (94), 18 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-09 22:24:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:16,156 INFO L225 Difference]: With dead ends: 161 [2025-01-09 22:24:16,156 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 22:24:16,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:24:16,157 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 106 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:16,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 111 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 22:24:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2025-01-09 22:24:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 119 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:24:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 150 transitions. [2025-01-09 22:24:16,165 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 150 transitions. Word has length 32 [2025-01-09 22:24:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:16,166 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 150 transitions. [2025-01-09 22:24:16,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.529411764705882) internal successors, (94), 18 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 150 transitions. [2025-01-09 22:24:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:24:16,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:16,167 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:16,176 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:24:16,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:24:16,373 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:16,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2009456408, now seen corresponding path program 1 times [2025-01-09 22:24:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310745924] [2025-01-09 22:24:16,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:16,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:24:16,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:24:16,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:16,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:16,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:16,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310745924] [2025-01-09 22:24:16,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310745924] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:16,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822695018] [2025-01-09 22:24:16,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:16,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:16,601 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:24:16,603 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:24:16,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:24:16,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:24:16,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:16,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:16,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 22:24:16,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:16,762 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:24:16,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 11 treesize of output 7 [2025-01-09 22:24:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:24:16,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:16,986 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 14 treesize of output 12 [2025-01-09 22:24:16,990 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 18 treesize of output 16 [2025-01-09 22:24:17,011 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 14 treesize of output 12 [2025-01-09 22:24:17,013 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 18 treesize of output 16 [2025-01-09 22:24:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:24:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822695018] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:17,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:17,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 15] total 22 [2025-01-09 22:24:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787722399] [2025-01-09 22:24:17,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:17,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:24:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:17,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:24:17,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:24:17,036 INFO L87 Difference]: Start difference. First operand 120 states and 150 transitions. Second operand has 22 states, 22 states have (on average 3.0) internal successors, (66), 22 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:24:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:17,922 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2025-01-09 22:24:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 22:24:17,923 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 22 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 33 [2025-01-09 22:24:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:17,923 INFO L225 Difference]: With dead ends: 153 [2025-01-09 22:24:17,924 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 22:24:17,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=2773, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 22:24:17,926 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 165 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:17,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 159 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:24:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 22:24:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2025-01-09 22:24:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 134 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:24:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 167 transitions. [2025-01-09 22:24:17,929 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 167 transitions. Word has length 33 [2025-01-09 22:24:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:17,929 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 167 transitions. [2025-01-09 22:24:17,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 22 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:24:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2025-01-09 22:24:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:24:17,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:17,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-01-09 22:24:17,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:18,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:18,131 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:18,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:18,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1472533133, now seen corresponding path program 2 times [2025-01-09 22:24:18,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:18,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047496867] [2025-01-09 22:24:18,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:18,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:24:18,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:24:18,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:18,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:24:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:18,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047496867] [2025-01-09 22:24:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047496867] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972833309] [2025-01-09 22:24:18,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:18,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:18,384 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:24:18,387 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:24:18,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:24:18,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:24:18,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:18,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:18,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:24:18,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:24:18,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:24:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972833309] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:18,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:18,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-01-09 22:24:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425692447] [2025-01-09 22:24:18,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:18,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:24:18,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:18,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:24:18,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:24:18,670 INFO L87 Difference]: Start difference. First operand 135 states and 167 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:19,049 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2025-01-09 22:24:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:24:19,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:24:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:19,050 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:24:19,050 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:24:19,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:24:19,051 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:19,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 66 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:24:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2025-01-09 22:24:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 120 states have (on average 1.2333333333333334) internal successors, (148), 123 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:24:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2025-01-09 22:24:19,055 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 36 [2025-01-09 22:24:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:19,055 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2025-01-09 22:24:19,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2025-01-09 22:24:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:24:19,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:19,056 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:19,064 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:24:19,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:19,257 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:19,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1741585680, now seen corresponding path program 1 times [2025-01-09 22:24:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:19,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53205443] [2025-01-09 22:24:19,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:19,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:19,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:24:19,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:24:19,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:19,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:19,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53205443] [2025-01-09 22:24:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53205443] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935634523] [2025-01-09 22:24:19,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:19,376 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:24:19,378 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:24:19,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:24:19,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:24:19,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:19,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:19,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:24:19,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:19,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:24:19,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935634523] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:19,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:19,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-01-09 22:24:19,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591896472] [2025-01-09 22:24:19,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:19,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:24:19,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:19,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:24:19,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:24:19,637 INFO L87 Difference]: Start difference. First operand 124 states and 148 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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:24:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:19,788 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2025-01-09 22:24:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:24:19,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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 36 [2025-01-09 22:24:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:19,789 INFO L225 Difference]: With dead ends: 119 [2025-01-09 22:24:19,789 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 22:24:19,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:24:19,790 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:19,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 113 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 22:24:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 22:24:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.208695652173913) internal successors, (139), 118 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:24:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2025-01-09 22:24:19,792 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 36 [2025-01-09 22:24:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:19,795 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2025-01-09 22:24:19,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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:24:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2025-01-09 22:24:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:24:19,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:19,796 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-01-09 22:24:19,804 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:24:19,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:19,997 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:19,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1827665728, now seen corresponding path program 1 times [2025-01-09 22:24:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231731653] [2025-01-09 22:24:19,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:20,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:24:20,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:24:20,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:20,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:24:20,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231731653] [2025-01-09 22:24:20,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231731653] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:20,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355076195] [2025-01-09 22:24:20,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:20,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:20,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:20,186 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:24:20,189 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:24:20,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:24:20,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:24:20,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:20,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:20,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:24:20,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 52 proven. 24 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:24:20,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 52 proven. 24 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:24:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355076195] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:20,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:20,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-01-09 22:24:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574281156] [2025-01-09 22:24:20,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:20,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:24:20,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:20,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:24:20,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:24:20,485 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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:24:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:20,606 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2025-01-09 22:24:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:24:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 22:24:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:20,611 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:24:20,611 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:24:20,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:24:20,612 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:20,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:24:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2025-01-09 22:24:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.1885245901639345) internal successors, (145), 125 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:24:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2025-01-09 22:24:20,618 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 52 [2025-01-09 22:24:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:20,619 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2025-01-09 22:24:20,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:24:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2025-01-09 22:24:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:24:20,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:20,619 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-01-09 22:24:20,627 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:24:20,819 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,SelfDestructingSolverStorable21 [2025-01-09 22:24:20,820 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:20,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:20,820 INFO L85 PathProgramCache]: Analyzing trace with hash -592340940, now seen corresponding path program 2 times [2025-01-09 22:24:20,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:20,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306602828] [2025-01-09 22:24:20,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:20,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-01-09 22:24:20,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 55 statements. [2025-01-09 22:24:20,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:24:20,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 22:24:20,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:20,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306602828] [2025-01-09 22:24:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306602828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:20,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12318115] [2025-01-09 22:24:20,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:20,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:20,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:20,910 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:24:20,912 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:24:21,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-01-09 22:24:21,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 55 statements. [2025-01-09 22:24:21,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:24:21,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:21,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:24:21,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:21,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-09 22:24:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 22:24:21,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 22:24:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12318115] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:21,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 22:24:21,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699784873] [2025-01-09 22:24:21,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:21,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:24:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:21,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:24:21,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:24:21,455 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:21,583 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-01-09 22:24:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:24:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 22:24:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:21,584 INFO L225 Difference]: With dead ends: 125 [2025-01-09 22:24:21,584 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 22:24:21,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:24:21,586 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:21,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 22:24:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-01-09 22:24:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.1475409836065573) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2025-01-09 22:24:21,589 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 55 [2025-01-09 22:24:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:21,591 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2025-01-09 22:24:21,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2025-01-09 22:24:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:24:21,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:21,592 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-01-09 22:24:21,600 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:24:21,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:21,793 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1591632802, now seen corresponding path program 2 times [2025-01-09 22:24:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048585911] [2025-01-09 22:24:21,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:21,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-01-09 22:24:21,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:24:21,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:21,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-09 22:24:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048585911] [2025-01-09 22:24:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048585911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777876767] [2025-01-09 22:24:22,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:22,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:22,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:22,141 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:24:22,142 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:24:22,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-01-09 22:24:22,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:24:22,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:22,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:22,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:24:22,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:22,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:22,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:24:22,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:22,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:24:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 48 proven. 52 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 22:24:22,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:22,729 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 52 treesize of output 48 [2025-01-09 22:24:22,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:24:22,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2025-01-09 22:24:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 48 proven. 52 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 22:24:22,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777876767] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:22,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:22,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-01-09 22:24:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297466838] [2025-01-09 22:24:22,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:22,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:24:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:22,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:24:22,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:24:22,994 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 24 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:24:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:23,809 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2025-01-09 22:24:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:24:23,810 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 24 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 58 [2025-01-09 22:24:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:23,811 INFO L225 Difference]: With dead ends: 176 [2025-01-09 22:24:23,811 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 22:24:23,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=568, Invalid=1982, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 22:24:23,812 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 129 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:23,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 143 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:24:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 22:24:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 121. [2025-01-09 22:24:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 119 states have (on average 1.1260504201680672) internal successors, (134), 120 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:24:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2025-01-09 22:24:23,818 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 58 [2025-01-09 22:24:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:23,818 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2025-01-09 22:24:23,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 24 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:24:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2025-01-09 22:24:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 22:24:23,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:23,819 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2025-01-09 22:24:23,829 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:24:24,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:24,021 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:24,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash 20458017, now seen corresponding path program 2 times [2025-01-09 22:24:24,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:24,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172301066] [2025-01-09 22:24:24,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:24,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:24,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-01-09 22:24:24,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 22:24:24,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:24,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 184 proven. 33 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 22:24:24,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:24,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172301066] [2025-01-09 22:24:24,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172301066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:24,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067542782] [2025-01-09 22:24:24,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:24,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:24,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:24,301 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:24:24,304 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:24:24,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-01-09 22:24:24,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 22:24:24,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:24,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:24:24,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 201 proven. 42 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 22:24:24,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 201 proven. 42 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 22:24:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067542782] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:24,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:24,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2025-01-09 22:24:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754223217] [2025-01-09 22:24:24,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:24,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:24:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:24,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:24:24,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:24:24,710 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 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:24:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:24,968 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2025-01-09 22:24:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:24:24,969 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 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 90 [2025-01-09 22:24:24,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:24,970 INFO L225 Difference]: With dead ends: 146 [2025-01-09 22:24:24,970 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 22:24:24,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 168 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:24:24,971 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:24,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 147 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 22:24:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2025-01-09 22:24:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 1.1145038167938932) internal successors, (146), 132 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:24:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2025-01-09 22:24:24,977 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 90 [2025-01-09 22:24:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:24,977 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2025-01-09 22:24:24,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 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:24:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2025-01-09 22:24:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 22:24:24,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:24,981 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2025-01-09 22:24:24,991 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:24:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:25,182 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:25,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash -630503767, now seen corresponding path program 3 times [2025-01-09 22:24:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913103875] [2025-01-09 22:24:25,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:24:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:25,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 6 equivalence classes. [2025-01-09 22:24:25,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 68 of 98 statements. [2025-01-09 22:24:25,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 22:24:25,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 158 proven. 19 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-09 22:24:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913103875] [2025-01-09 22:24:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913103875] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895252639] [2025-01-09 22:24:25,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:24:25,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:25,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:25,388 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:24:25,389 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:24:25,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 6 equivalence classes. [2025-01-09 22:24:25,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 68 of 98 statements. [2025-01-09 22:24:25,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 22:24:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:25,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:24:25,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 163 proven. 14 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-09 22:24:25,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 163 proven. 14 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-09 22:24:25,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895252639] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:25,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-09 22:24:25,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416422605] [2025-01-09 22:24:25,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:25,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:24:25,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:25,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:24:25,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:24:25,772 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:24:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:25,977 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-01-09 22:24:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:24:25,977 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 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 98 [2025-01-09 22:24:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:25,978 INFO L225 Difference]: With dead ends: 152 [2025-01-09 22:24:25,978 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 22:24:25,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 185 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:24:25,979 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:25,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 162 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 22:24:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2025-01-09 22:24:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 140 states have (on average 1.1071428571428572) internal successors, (155), 141 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2025-01-09 22:24:25,984 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 98 [2025-01-09 22:24:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:25,984 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2025-01-09 22:24:25,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:24:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2025-01-09 22:24:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 22:24:25,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:25,985 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2025-01-09 22:24:26,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-09 22:24:26,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:24:26,186 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:26,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1967061181, now seen corresponding path program 4 times [2025-01-09 22:24:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:26,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445311919] [2025-01-09 22:24:26,186 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:24:26,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:26,206 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-01-09 22:24:26,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 22:24:26,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:24:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 257 proven. 109 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 22:24:26,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:26,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445311919] [2025-01-09 22:24:26,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445311919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:26,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877356404] [2025-01-09 22:24:26,417 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:24:26,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:26,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:26,419 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:24:26,422 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:24:26,559 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-01-09 22:24:26,862 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 22:24:26,863 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:24:26,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:26,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:24:26,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 257 proven. 109 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 22:24:27,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 257 proven. 109 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 22:24:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877356404] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:27,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-01-09 22:24:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920605784] [2025-01-09 22:24:27,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:27,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:24:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:27,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:24:27,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:24:27,174 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 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:24:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:27,344 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2025-01-09 22:24:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:24:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 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 104 [2025-01-09 22:24:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:27,345 INFO L225 Difference]: With dead ends: 156 [2025-01-09 22:24:27,345 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 22:24:27,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 195 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:24:27,345 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:27,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 109 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 22:24:27,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2025-01-09 22:24:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 148 states have (on average 1.1013513513513513) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2025-01-09 22:24:27,349 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 104 [2025-01-09 22:24:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:27,349 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2025-01-09 22:24:27,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 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:24:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2025-01-09 22:24:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 22:24:27,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:27,350 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2025-01-09 22:24:27,360 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:24:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:27,551 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:27,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash -75392775, now seen corresponding path program 5 times [2025-01-09 22:24:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:27,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568687148] [2025-01-09 22:24:27,552 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:24:27,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:27,568 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 108 statements into 6 equivalence classes. [2025-01-09 22:24:27,723 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 22:24:27,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-09 22:24:27,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 229 proven. 25 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-01-09 22:24:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568687148] [2025-01-09 22:24:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568687148] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755743083] [2025-01-09 22:24:27,905 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:24:27,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:27,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:27,907 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:24:27,910 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:24:28,055 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 108 statements into 6 equivalence classes. [2025-01-09 22:24:28,375 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 22:24:28,375 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-09 22:24:28,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:28,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:24:28,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 229 proven. 25 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-01-09 22:24:28,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 229 proven. 25 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-01-09 22:24:28,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755743083] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:28,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-01-09 22:24:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242406087] [2025-01-09 22:24:28,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:28,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:24:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:28,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:24:28,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:24:28,521 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 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:24:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:28,746 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2025-01-09 22:24:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:24:28,749 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-01-09 22:24:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:28,750 INFO L225 Difference]: With dead ends: 186 [2025-01-09 22:24:28,750 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 22:24:28,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:24:28,750 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:28,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 178 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 22:24:28,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 163. [2025-01-09 22:24:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.0993788819875776) internal successors, (177), 162 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2025-01-09 22:24:28,754 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 108 [2025-01-09 22:24:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:28,754 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2025-01-09 22:24:28,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 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:24:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2025-01-09 22:24:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 22:24:28,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:28,755 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2025-01-09 22:24:28,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-09 22:24:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:24:28,956 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 543237427, now seen corresponding path program 6 times [2025-01-09 22:24:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355926057] [2025-01-09 22:24:28,956 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:24:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:28,976 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 6 equivalence classes. [2025-01-09 22:24:29,096 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 22:24:29,096 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-09 22:24:29,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 77 proven. 326 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 22:24:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355926057] [2025-01-09 22:24:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355926057] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749143988] [2025-01-09 22:24:30,411 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:24:30,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:30,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:30,414 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:24:30,416 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:24:30,570 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 6 equivalence classes. [2025-01-09 22:24:30,821 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 22:24:30,821 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-09 22:24:30,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:30,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 22:24:30,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:30,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:24:30,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:24:30,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:30,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:24:30,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:30,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:24:30,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:30,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:24:30,937 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:30,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:24:30,986 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:30,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:24:31,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:24:31,111 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:24:31,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:24:31,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:24:31,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:31,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:24:31,615 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-01-09 22:24:31,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-01-09 22:24:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 115 proven. 292 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 22:24:31,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:32,304 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:24:32,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 22:24:32,856 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:24:32,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-09 22:24:33,004 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:24:33,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-09 22:24:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-01-09 22:24:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749143988] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:33,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 14] total 47 [2025-01-09 22:24:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571214124] [2025-01-09 22:24:33,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:24:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:33,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:24:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1901, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:24:33,117 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 48 states, 47 states have (on average 4.127659574468085) internal successors, (194), 48 states have internal predecessors, (194), 0 states have call successors, (0), 0 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:24:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:37,016 INFO L93 Difference]: Finished difference Result 333 states and 369 transitions. [2025-01-09 22:24:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-01-09 22:24:37,017 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.127659574468085) internal successors, (194), 48 states have internal predecessors, (194), 0 states have call successors, (0), 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 111 [2025-01-09 22:24:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:37,018 INFO L225 Difference]: With dead ends: 333 [2025-01-09 22:24:37,018 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 22:24:37,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 192 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4120 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3451, Invalid=10591, Unknown=0, NotChecked=0, Total=14042 [2025-01-09 22:24:37,021 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 840 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:37,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 92 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:24:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 22:24:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 313. [2025-01-09 22:24:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 311 states have (on average 1.1189710610932475) internal successors, (348), 312 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:24:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 348 transitions. [2025-01-09 22:24:37,028 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 348 transitions. Word has length 111 [2025-01-09 22:24:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:37,029 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 348 transitions. [2025-01-09 22:24:37,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.127659574468085) internal successors, (194), 48 states have internal predecessors, (194), 0 states have call successors, (0), 0 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:24:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 348 transitions. [2025-01-09 22:24:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 22:24:37,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:37,030 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:37,040 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:24:37,230 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,SelfDestructingSolverStorable28 [2025-01-09 22:24:37,231 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:37,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash 390756750, now seen corresponding path program 2 times [2025-01-09 22:24:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:37,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868749346] [2025-01-09 22:24:37,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:37,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-01-09 22:24:37,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 22:24:37,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:37,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 791 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 22:24:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868749346] [2025-01-09 22:24:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868749346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962665297] [2025-01-09 22:24:37,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:37,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:37,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:37,475 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:24:37,478 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:24:37,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-01-09 22:24:37,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 22:24:37,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:37,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:37,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 22:24:37,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 596 proven. 223 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 22:24:38,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 596 proven. 223 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 22:24:38,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962665297] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:38,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:38,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 25 [2025-01-09 22:24:38,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905679294] [2025-01-09 22:24:38,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:38,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:24:38,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:38,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:24:38,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:24:38,206 INFO L87 Difference]: Start difference. First operand 313 states and 348 transitions. Second operand has 25 states, 25 states have (on average 8.24) internal successors, (206), 25 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:24:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:38,780 INFO L93 Difference]: Finished difference Result 511 states and 572 transitions. [2025-01-09 22:24:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 22:24:38,781 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.24) internal successors, (206), 25 states have internal predecessors, (206), 0 states have call successors, (0), 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 154 [2025-01-09 22:24:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:38,782 INFO L225 Difference]: With dead ends: 511 [2025-01-09 22:24:38,782 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 22:24:38,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 286 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=700, Invalid=2722, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 22:24:38,784 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 196 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:38,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 303 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 22:24:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 383. [2025-01-09 22:24:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 381 states have (on average 1.1181102362204725) internal successors, (426), 382 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:24:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 426 transitions. [2025-01-09 22:24:38,793 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 426 transitions. Word has length 154 [2025-01-09 22:24:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:38,793 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 426 transitions. [2025-01-09 22:24:38,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.24) internal successors, (206), 25 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:24:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 426 transitions. [2025-01-09 22:24:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 22:24:38,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:38,794 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:38,802 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:24:38,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:38,997 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:38,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash -973444148, now seen corresponding path program 3 times [2025-01-09 22:24:38,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:38,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317453629] [2025-01-09 22:24:38,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:24:38,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:39,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 198 statements into 9 equivalence classes. [2025-01-09 22:24:39,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 100 of 198 statements. [2025-01-09 22:24:39,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 22:24:39,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 600 proven. 22 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2025-01-09 22:24:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317453629] [2025-01-09 22:24:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317453629] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127505283] [2025-01-09 22:24:39,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:24:39,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:39,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:39,300 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:24:39,302 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:24:39,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 198 statements into 9 equivalence classes. [2025-01-09 22:24:39,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 100 of 198 statements. [2025-01-09 22:24:39,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 22:24:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:39,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:24:39,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 600 proven. 22 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2025-01-09 22:24:39,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 600 proven. 22 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2025-01-09 22:24:39,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127505283] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:39,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-01-09 22:24:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26880098] [2025-01-09 22:24:39,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:39,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:24:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:39,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:24:39,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:24:39,887 INFO L87 Difference]: Start difference. First operand 383 states and 426 transitions. Second operand has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:40,397 INFO L93 Difference]: Finished difference Result 955 states and 1078 transitions. [2025-01-09 22:24:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 22:24:40,398 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-01-09 22:24:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:40,401 INFO L225 Difference]: With dead ends: 955 [2025-01-09 22:24:40,401 INFO L226 Difference]: Without dead ends: 955 [2025-01-09 22:24:40,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=824, Invalid=1626, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 22:24:40,402 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 235 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:40,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 79 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-01-09 22:24:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 520. [2025-01-09 22:24:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 518 states have (on average 1.1332046332046333) internal successors, (587), 519 states have internal predecessors, (587), 0 states have call successors, (0), 0 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:24:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 587 transitions. [2025-01-09 22:24:40,412 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 587 transitions. Word has length 198 [2025-01-09 22:24:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:40,412 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 587 transitions. [2025-01-09 22:24:40,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 587 transitions. [2025-01-09 22:24:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 22:24:40,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:40,417 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 20, 20, 20, 20, 7, 7, 7, 7, 7, 6, 6, 5, 2, 1, 1, 1] [2025-01-09 22:24:40,426 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:24:40,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:40,617 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:40,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1635612951, now seen corresponding path program 7 times [2025-01-09 22:24:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:40,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244110362] [2025-01-09 22:24:40,618 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 22:24:40,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:40,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 22:24:40,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 22:24:40,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:40,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 900 proven. 153 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2025-01-09 22:24:40,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:40,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244110362] [2025-01-09 22:24:40,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244110362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:40,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136194134] [2025-01-09 22:24:40,977 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 22:24:40,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:40,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:40,980 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:24:40,982 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:24:41,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 22:24:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 22:24:41,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:41,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:41,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 22:24:41,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 907 proven. 146 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2025-01-09 22:24:41,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 907 proven. 146 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2025-01-09 22:24:41,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136194134] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:41,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:41,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-01-09 22:24:41,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137785023] [2025-01-09 22:24:41,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:41,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:24:41,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:41,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:24:41,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:24:41,487 INFO L87 Difference]: Start difference. First operand 520 states and 587 transitions. Second operand has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:41,662 INFO L93 Difference]: Finished difference Result 516 states and 579 transitions. [2025-01-09 22:24:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:24:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-09 22:24:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:41,665 INFO L225 Difference]: With dead ends: 516 [2025-01-09 22:24:41,665 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 22:24:41,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 399 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:24:41,665 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 59 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:41,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 91 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 22:24:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2025-01-09 22:24:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 498 states have (on average 1.1285140562248996) internal successors, (562), 499 states have internal predecessors, (562), 0 states have call successors, (0), 0 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:24:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 562 transitions. [2025-01-09 22:24:41,675 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 562 transitions. Word has length 206 [2025-01-09 22:24:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:41,675 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 562 transitions. [2025-01-09 22:24:41,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 562 transitions. [2025-01-09 22:24:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 22:24:41,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:41,677 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:41,687 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:24:41,877 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,SelfDestructingSolverStorable31 [2025-01-09 22:24:41,878 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:41,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash 258376072, now seen corresponding path program 4 times [2025-01-09 22:24:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344820405] [2025-01-09 22:24:41,878 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:24:41,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:41,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 222 statements into 2 equivalence classes. [2025-01-09 22:24:41,971 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 22:24:41,971 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:24:41,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 1859 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 22:24:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344820405] [2025-01-09 22:24:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344820405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581517633] [2025-01-09 22:24:42,206 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:24:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:42,208 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:24:42,210 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:24:42,435 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 222 statements into 2 equivalence classes. [2025-01-09 22:24:44,620 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 22:24:44,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:24:44,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:44,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 22:24:44,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 1387 proven. 28 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2025-01-09 22:24:44,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 1387 proven. 28 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2025-01-09 22:24:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581517633] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:44,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:44,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 25 [2025-01-09 22:24:44,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290878328] [2025-01-09 22:24:44,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:44,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:24:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:44,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:24:44,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:24:44,862 INFO L87 Difference]: Start difference. First operand 500 states and 562 transitions. Second operand has 25 states, 25 states have (on average 7.36) internal successors, (184), 25 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:24:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:45,495 INFO L93 Difference]: Finished difference Result 1053 states and 1193 transitions. [2025-01-09 22:24:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-09 22:24:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.36) internal successors, (184), 25 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 222 [2025-01-09 22:24:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:45,498 INFO L225 Difference]: With dead ends: 1053 [2025-01-09 22:24:45,499 INFO L226 Difference]: Without dead ends: 1053 [2025-01-09 22:24:45,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 424 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1185, Invalid=3645, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 22:24:45,501 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 106 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:45,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 118 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-01-09 22:24:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 468. [2025-01-09 22:24:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 466 states have (on average 1.1266094420600858) internal successors, (525), 467 states have internal predecessors, (525), 0 states have call successors, (0), 0 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:24:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 525 transitions. [2025-01-09 22:24:45,510 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 525 transitions. Word has length 222 [2025-01-09 22:24:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:45,510 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 525 transitions. [2025-01-09 22:24:45,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.36) internal successors, (184), 25 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:24:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 525 transitions. [2025-01-09 22:24:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-09 22:24:45,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:45,512 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 8, 8, 8, 8, 8, 7, 7, 6, 2, 1, 1, 1] [2025-01-09 22:24:45,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-01-09 22:24:45,712 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,SelfDestructingSolverStorable32 [2025-01-09 22:24:45,713 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:45,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash -316010387, now seen corresponding path program 8 times [2025-01-09 22:24:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042475739] [2025-01-09 22:24:45,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:45,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 243 statements into 2 equivalence classes. [2025-01-09 22:24:45,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 243 of 243 statements. [2025-01-09 22:24:45,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:45,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2800 backedges. 1757 proven. 470 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-01-09 22:24:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:46,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042475739] [2025-01-09 22:24:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042475739] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:46,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493115972] [2025-01-09 22:24:46,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:46,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:46,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:46,239 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:24:46,241 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:24:46,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 243 statements into 2 equivalence classes. [2025-01-09 22:24:46,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 243 of 243 statements. [2025-01-09 22:24:46,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:46,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:46,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 22:24:46,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2800 backedges. 1810 proven. 417 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-01-09 22:24:46,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2800 backedges. 1810 proven. 417 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-01-09 22:24:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493115972] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:47,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:47,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-01-09 22:24:47,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289922562] [2025-01-09 22:24:47,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:47,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:24:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:47,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:24:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:24:47,031 INFO L87 Difference]: Start difference. First operand 468 states and 525 transitions. Second operand has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 21 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:24:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:47,284 INFO L93 Difference]: Finished difference Result 369 states and 406 transitions. [2025-01-09 22:24:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:24:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 21 states have internal predecessors, (132), 0 states have call successors, (0), 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 243 [2025-01-09 22:24:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:47,286 INFO L225 Difference]: With dead ends: 369 [2025-01-09 22:24:47,286 INFO L226 Difference]: Without dead ends: 369 [2025-01-09 22:24:47,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 468 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:24:47,287 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 61 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:47,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 328 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-09 22:24:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 360. [2025-01-09 22:24:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 358 states have (on average 1.1089385474860336) internal successors, (397), 359 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:24:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 397 transitions. [2025-01-09 22:24:47,292 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 397 transitions. Word has length 243 [2025-01-09 22:24:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:47,292 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 397 transitions. [2025-01-09 22:24:47,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 21 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:24:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 397 transitions. [2025-01-09 22:24:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 22:24:47,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:47,293 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 25, 25, 25, 25, 8, 8, 8, 8, 8, 7, 7, 6, 2, 1, 1, 1] [2025-01-09 22:24:47,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:47,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:47,494 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:47,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1708194741, now seen corresponding path program 9 times [2025-01-09 22:24:47,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:47,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983061155] [2025-01-09 22:24:47,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:24:47,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:47,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 249 statements into 10 equivalence classes. [2025-01-09 22:24:47,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 172 of 249 statements. [2025-01-09 22:24:47,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 22:24:47,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 1621 proven. 186 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2025-01-09 22:24:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983061155] [2025-01-09 22:24:48,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983061155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69218850] [2025-01-09 22:24:48,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:24:48,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:48,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:48,090 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:24:48,093 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:24:48,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 249 statements into 10 equivalence classes. [2025-01-09 22:24:48,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 172 of 249 statements. [2025-01-09 22:24:48,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 22:24:48,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:48,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:24:48,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 1805 proven. 819 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-01-09 22:24:48,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 1805 proven. 819 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-01-09 22:24:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69218850] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:49,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:49,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2025-01-09 22:24:49,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999994608] [2025-01-09 22:24:49,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:49,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 22:24:49,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:49,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 22:24:49,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:24:49,134 INFO L87 Difference]: Start difference. First operand 360 states and 397 transitions. Second operand has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:24:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:50,080 INFO L93 Difference]: Finished difference Result 445 states and 486 transitions. [2025-01-09 22:24:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 22:24:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 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 249 [2025-01-09 22:24:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:50,081 INFO L225 Difference]: With dead ends: 445 [2025-01-09 22:24:50,081 INFO L226 Difference]: Without dead ends: 445 [2025-01-09 22:24:50,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 473 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=999, Invalid=3557, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 22:24:50,082 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 109 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:50,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 429 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:24:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-01-09 22:24:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 382. [2025-01-09 22:24:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 380 states have (on average 1.105263157894737) internal successors, (420), 381 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:24:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 420 transitions. [2025-01-09 22:24:50,088 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 420 transitions. Word has length 249 [2025-01-09 22:24:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:50,088 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 420 transitions. [2025-01-09 22:24:50,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:24:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 420 transitions. [2025-01-09 22:24:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-01-09 22:24:50,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:50,090 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 8, 8, 8, 8, 8, 7, 7, 6, 2, 1, 1, 1] [2025-01-09 22:24:50,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-01-09 22:24:50,290 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,SelfDestructingSolverStorable34 [2025-01-09 22:24:50,291 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:24:50,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash -319031507, now seen corresponding path program 10 times [2025-01-09 22:24:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916121932] [2025-01-09 22:24:50,292 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:24:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:50,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 257 statements into 2 equivalence classes. [2025-01-09 22:24:50,497 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 257 of 257 statements. [2025-01-09 22:24:50,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:24:50,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3195 backedges. 1948 proven. 85 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2025-01-09 22:24:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916121932] [2025-01-09 22:24:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916121932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166461121] [2025-01-09 22:24:51,019 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:24:51,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:51,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:51,021 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:24:51,024 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:24:51,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 257 statements into 2 equivalence classes. [2025-01-09 22:25:18,100 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 257 of 257 statements. [2025-01-09 22:25:18,101 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:25:18,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:25:18,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:25:18,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:25:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3195 backedges. 1967 proven. 66 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2025-01-09 22:25:18,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:25:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3195 backedges. 1967 proven. 66 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2025-01-09 22:25:18,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166461121] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:25:18,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:25:18,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2025-01-09 22:25:18,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736707093] [2025-01-09 22:25:18,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:25:18,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:25:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:25:18,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:25:18,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:25:18,393 INFO L87 Difference]: Start difference. First operand 382 states and 420 transitions. Second operand has 28 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:25:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:25:18,887 INFO L93 Difference]: Finished difference Result 732 states and 810 transitions. [2025-01-09 22:25:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-09 22:25:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 states have internal predecessors, (118), 0 states have call successors, (0), 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 257 [2025-01-09 22:25:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:25:18,889 INFO L225 Difference]: With dead ends: 732 [2025-01-09 22:25:18,889 INFO L226 Difference]: Without dead ends: 732 [2025-01-09 22:25:18,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 492 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1001, Invalid=3031, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 22:25:18,891 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 152 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:25:18,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 120 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:25:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-01-09 22:25:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 607. [2025-01-09 22:25:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 605 states have (on average 1.1008264462809918) internal successors, (666), 606 states have internal predecessors, (666), 0 states have call successors, (0), 0 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:25:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 666 transitions. [2025-01-09 22:25:18,901 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 666 transitions. Word has length 257 [2025-01-09 22:25:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:25:18,901 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 666 transitions. [2025-01-09 22:25:18,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:25:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 666 transitions. [2025-01-09 22:25:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-09 22:25:18,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:25:18,903 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 8, 8, 8, 8, 8, 7, 7, 6, 2, 1, 1, 1] [2025-01-09 22:25:18,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-01-09 22:25:19,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-09 22:25:19,104 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-09 22:25:19,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:25:19,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1596466597, now seen corresponding path program 11 times [2025-01-09 22:25:19,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:25:19,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395356150] [2025-01-09 22:25:19,104 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:25:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:25:19,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 265 statements into 10 equivalence classes. [2025-01-09 22:25:19,414 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 241 of 265 statements. [2025-01-09 22:25:19,414 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-09 22:25:19,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:25:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 1670 proven. 1206 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-01-09 22:25:19,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:25:19,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395356150] [2025-01-09 22:25:19,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395356150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:25:19,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035360660] [2025-01-09 22:25:19,877 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:25:19,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:19,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:25:19,880 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:25:19,882 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:25:20,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 265 statements into 10 equivalence classes.