./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86c4ccee9690ccdd33683565314ba095e56520aa142914bd8063fc7c4c92940d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:06:35,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:06:35,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:06:35,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:06:35,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:06:35,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:06:35,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:06:35,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:06:35,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:06:35,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:06:35,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:06:35,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:06:35,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:06:35,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:06:35,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:06:35,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:06:35,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:06:35,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:06:35,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:06:35,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:06:35,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:06:35,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:06:35,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:06:35,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:06:35,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:06:35,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:06:35,811 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 -> 86c4ccee9690ccdd33683565314ba095e56520aa142914bd8063fc7c4c92940d [2025-02-06 10:06:36,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:06:36,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:06:36,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:06:36,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:06:36,007 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:06:36,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2025-02-06 10:06:37,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6885d4f/d4d28682b98a4f0c8d864cd00a2a306e/FLAG2ebebcf88 [2025-02-06 10:06:37,546 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:06:37,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2025-02-06 10:06:37,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6885d4f/d4d28682b98a4f0c8d864cd00a2a306e/FLAG2ebebcf88 [2025-02-06 10:06:37,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6885d4f/d4d28682b98a4f0c8d864cd00a2a306e [2025-02-06 10:06:37,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:06:37,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:06:37,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:06:37,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:06:37,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:06:37,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:06:37" (1/1) ... [2025-02-06 10:06:37,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0194a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:37, skipping insertion in model container [2025-02-06 10:06:37,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:06:37" (1/1) ... [2025-02-06 10:06:37,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:06:38,039 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:06:38,040 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:06:38,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:06:38,053 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:06:38,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:06:38,106 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:06:38,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38 WrapperNode [2025-02-06 10:06:38,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:06:38,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:06:38,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:06:38,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:06:38,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,136 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2025-02-06 10:06:38,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:06:38,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:06:38,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:06:38,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:06:38,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,155 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-06 10:06:38,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:06:38,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:06:38,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:06:38,163 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:06:38,163 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (1/1) ... [2025-02-06 10:06:38,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:06:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:38,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:06:38,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:06:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:06:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:06:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:06:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:06:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:06:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:06:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:06:38,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:06:38,283 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:06:38,285 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:06:38,428 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc main_#t~ret14#1;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-02-06 10:06:38,442 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-06 10:06:38,444 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:06:38,450 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:06:38,451 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:06:38,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:06:38 BoogieIcfgContainer [2025-02-06 10:06:38,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:06:38,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:06:38,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:06:38,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:06:38,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:06:37" (1/3) ... [2025-02-06 10:06:38,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5719f5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:06:38, skipping insertion in model container [2025-02-06 10:06:38,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:38" (2/3) ... [2025-02-06 10:06:38,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5719f5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:06:38, skipping insertion in model container [2025-02-06 10:06:38,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:06:38" (3/3) ... [2025-02-06 10:06:38,459 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-2.i [2025-02-06 10:06:38,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:06:38,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrcspn-alloca-2.i that has 1 procedures, 39 locations, 1 initial locations, 4 loop locations, and 13 error locations. [2025-02-06 10:06:38,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:06:38,509 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;@720c68ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:06:38,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 10:06:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.84) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:06:38,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:38,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:38,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:38,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1864678153, now seen corresponding path program 1 times [2025-02-06 10:06:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:38,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033550350] [2025-02-06 10:06:38,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:38,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:06:38,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:06:38,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:38,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:38,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:38,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033550350] [2025-02-06 10:06:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033550350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:38,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534058952] [2025-02-06 10:06:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:38,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:38,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:38,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:38,726 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.84) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:38,763 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-02-06 10:06:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:06:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:38,768 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:06:38,768 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:06:38,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:38,773 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:38,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:06:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2025-02-06 10:06:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-02-06 10:06:38,798 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 7 [2025-02-06 10:06:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:38,798 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-06 10:06:38,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-02-06 10:06:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:06:38,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:38,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:38,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:06:38,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:38,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1865601674, now seen corresponding path program 1 times [2025-02-06 10:06:38,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:38,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914009488] [2025-02-06 10:06:38,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:38,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:38,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:06:38,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:06:38,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:38,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914009488] [2025-02-06 10:06:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914009488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:06:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081450636] [2025-02-06 10:06:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:38,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:06:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:38,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:06:38,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:06:38,919 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:38,957 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-02-06 10:06:38,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:06:38,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:06:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:38,958 INFO L225 Difference]: With dead ends: 38 [2025-02-06 10:06:38,958 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 10:06:38,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:06:38,959 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:38,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 45 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 10:06:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 10:06:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-02-06 10:06:38,965 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 7 [2025-02-06 10:06:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:38,965 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-06 10:06:38,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-02-06 10:06:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:06:38,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:38,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:38,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:06:38,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:38,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1865601675, now seen corresponding path program 1 times [2025-02-06 10:06:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:38,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855083561] [2025-02-06 10:06:38,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:38,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:38,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:06:38,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:06:38,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:38,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:39,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855083561] [2025-02-06 10:06:39,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855083561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:39,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:39,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:06:39,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856041276] [2025-02-06 10:06:39,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:39,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:06:39,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:39,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:06:39,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:06:39,218 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:39,278 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-02-06 10:06:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:39,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:06:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:39,280 INFO L225 Difference]: With dead ends: 41 [2025-02-06 10:06:39,281 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 10:06:39,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:06:39,281 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:39,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 10:06:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-02-06 10:06:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-02-06 10:06:39,288 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 7 [2025-02-06 10:06:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:39,288 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-02-06 10:06:39,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-02-06 10:06:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:06:39,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:39,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:39,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:06:39,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:39,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1970442998, now seen corresponding path program 1 times [2025-02-06 10:06:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:39,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556545548] [2025-02-06 10:06:39,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:39,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:06:39,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:06:39,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:39,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:39,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556545548] [2025-02-06 10:06:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556545548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35514772] [2025-02-06 10:06:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:39,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:39,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:39,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:39,321 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:39,335 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2025-02-06 10:06:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:39,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:06:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:39,336 INFO L225 Difference]: With dead ends: 54 [2025-02-06 10:06:39,336 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 10:06:39,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:39,337 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:39,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 10:06:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2025-02-06 10:06:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-02-06 10:06:39,340 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 8 [2025-02-06 10:06:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:39,340 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-02-06 10:06:39,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-02-06 10:06:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:06:39,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:39,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:39,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:06:39,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:39,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1970442839, now seen corresponding path program 1 times [2025-02-06 10:06:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244826649] [2025-02-06 10:06:39,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:39,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:39,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:06:39,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:06:39,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:39,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244826649] [2025-02-06 10:06:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244826649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:39,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:39,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:06:39,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040193304] [2025-02-06 10:06:39,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:39,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:39,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:39,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:39,431 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:39,461 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-02-06 10:06:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:06:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:39,462 INFO L225 Difference]: With dead ends: 56 [2025-02-06 10:06:39,462 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:06:39,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:39,463 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:39,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:06:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-02-06 10:06:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.558139534883721) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-02-06 10:06:39,466 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 8 [2025-02-06 10:06:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:39,466 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-02-06 10:06:39,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-02-06 10:06:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:06:39,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:39,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:39,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:06:39,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:39,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1971366519, now seen corresponding path program 1 times [2025-02-06 10:06:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:39,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459870564] [2025-02-06 10:06:39,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:39,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:06:39,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:06:39,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:39,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:39,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:39,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459870564] [2025-02-06 10:06:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459870564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:39,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:06:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261443395] [2025-02-06 10:06:39,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:39,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:06:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:39,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:06:39,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:06:39,518 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:39,536 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-02-06 10:06:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:06:39,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:06:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:39,537 INFO L225 Difference]: With dead ends: 52 [2025-02-06 10:06:39,537 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 10:06:39,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:06:39,538 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:39,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 10:06:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 10:06:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 51 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-02-06 10:06:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2025-02-06 10:06:39,540 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 8 [2025-02-06 10:06:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2025-02-06 10:06:39,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2025-02-06 10:06:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:06:39,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:39,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:39,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:06:39,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:39,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1971366520, now seen corresponding path program 1 times [2025-02-06 10:06:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368480947] [2025-02-06 10:06:39,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:39,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:06:39,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:06:39,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:39,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:39,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:39,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368480947] [2025-02-06 10:06:39,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368480947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:39,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:39,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:06:39,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078766805] [2025-02-06 10:06:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:39,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:06:39,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:39,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:06:39,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:06:39,634 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:39,689 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2025-02-06 10:06:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:06:39,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:06:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:39,690 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:06:39,690 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:06:39,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:06:39,691 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:39,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 76 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:06:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-06 10:06:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 55 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-02-06 10:06:39,693 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 8 [2025-02-06 10:06:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:39,693 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-06 10:06:39,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-02-06 10:06:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:06:39,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:39,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:39,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:06:39,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:39,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1999071990, now seen corresponding path program 1 times [2025-02-06 10:06:39,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:39,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642333980] [2025-02-06 10:06:39,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:39,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:06:39,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:06:39,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:39,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:39,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:39,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642333980] [2025-02-06 10:06:39,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642333980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:39,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:39,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787833960] [2025-02-06 10:06:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:39,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:39,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:39,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:39,817 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:39,851 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2025-02-06 10:06:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:39,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:06:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:39,852 INFO L225 Difference]: With dead ends: 66 [2025-02-06 10:06:39,852 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 10:06:39,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:39,852 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:39,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 10:06:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2025-02-06 10:06:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 55 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-02-06 10:06:39,855 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 8 [2025-02-06 10:06:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:39,856 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-06 10:06:39,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-02-06 10:06:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:06:39,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:39,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:39,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:06:39,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 954185828, now seen corresponding path program 1 times [2025-02-06 10:06:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260457137] [2025-02-06 10:06:39,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:39,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:06:39,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:06:39,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:39,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:39,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:39,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260457137] [2025-02-06 10:06:39,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260457137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:39,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:39,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:06:39,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110452272] [2025-02-06 10:06:39,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:39,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:39,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:39,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:39,947 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:39,977 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2025-02-06 10:06:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:39,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:06:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:39,978 INFO L225 Difference]: With dead ends: 61 [2025-02-06 10:06:39,978 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 10:06:39,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:39,979 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:39,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 80 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 10:06:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-02-06 10:06:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.48) internal successors, (74), 58 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2025-02-06 10:06:39,982 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 9 [2025-02-06 10:06:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:39,982 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2025-02-06 10:06:39,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2025-02-06 10:06:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:06:39,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:39,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:39,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:06:39,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash 982814979, now seen corresponding path program 1 times [2025-02-06 10:06:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714812452] [2025-02-06 10:06:39,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:39,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:06:39,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:06:39,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:39,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:40,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714812452] [2025-02-06 10:06:40,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714812452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:40,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:40,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975050104] [2025-02-06 10:06:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:40,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:40,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:40,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:40,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:40,058 INFO L87 Difference]: Start difference. First operand 59 states and 74 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-02-06 10:06:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:40,081 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2025-02-06 10:06:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:40,082 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-02-06 10:06:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:40,082 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:06:40,082 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:06:40,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:40,082 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:40,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:06:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-02-06 10:06:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 54 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-02-06 10:06:40,085 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 9 [2025-02-06 10:06:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:40,085 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-02-06 10:06:40,085 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-02-06 10:06:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-02-06 10:06:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:06:40,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:40,085 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:40,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:06:40,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:40,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1262665978, now seen corresponding path program 1 times [2025-02-06 10:06:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487518670] [2025-02-06 10:06:40,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:40,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:06:40,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:06:40,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:40,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:40,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:40,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487518670] [2025-02-06 10:06:40,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487518670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:40,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910126639] [2025-02-06 10:06:40,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:40,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:40,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:40,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:40,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:06:40,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:06:40,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:06:40,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:40,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:40,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 10:06:40,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:40,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:40,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-06 10:06:40,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:06:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:40,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:40,620 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:06:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:40,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910126639] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:40,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-02-06 10:06:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109164383] [2025-02-06 10:06:40,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:40,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:06:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:40,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:06:40,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:06:40,663 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:40,806 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2025-02-06 10:06:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:06:40,807 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:06:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:40,807 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:06:40,807 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:06:40,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:06:40,807 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:40,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 155 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:06:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-02-06 10:06:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2025-02-06 10:06:40,809 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 10 [2025-02-06 10:06:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:40,809 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2025-02-06 10:06:40,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2025-02-06 10:06:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:06:40,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:40,810 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:40,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:06:41,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 10:06:41,011 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:41,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash -402837849, now seen corresponding path program 1 times [2025-02-06 10:06:41,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:41,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684531729] [2025-02-06 10:06:41,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:41,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:06:41,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:06:41,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:41,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684531729] [2025-02-06 10:06:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684531729] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582907778] [2025-02-06 10:06:41,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:41,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:41,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:41,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:06:41,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:06:41,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:06:41,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:41,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:41,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:06:41,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:41,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-06 10:06:41,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:06:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:41,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:41,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582907778] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:41,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:41,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-02-06 10:06:41,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238423849] [2025-02-06 10:06:41,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:41,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:06:41,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:41,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:06:41,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:06:41,618 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:41,778 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-02-06 10:06:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:06:41,779 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:06:41,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:41,779 INFO L225 Difference]: With dead ends: 55 [2025-02-06 10:06:41,779 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 10:06:41,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:06:41,780 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:41,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 126 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 10:06:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2025-02-06 10:06:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-02-06 10:06:41,781 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 11 [2025-02-06 10:06:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:41,781 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-02-06 10:06:41,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-02-06 10:06:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:06:41,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:41,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:41,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:06:41,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:41,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:41,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash 487934567, now seen corresponding path program 1 times [2025-02-06 10:06:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691543924] [2025-02-06 10:06:41,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:41,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:06:42,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:06:42,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:42,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691543924] [2025-02-06 10:06:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691543924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597180703] [2025-02-06 10:06:42,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:42,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:42,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:42,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:06:42,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:06:42,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:06:42,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:42,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:42,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 10:06:42,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:42,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:42,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-06 10:06:42,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:06:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:42,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:42,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597180703] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:42,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:42,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-02-06 10:06:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550723178] [2025-02-06 10:06:42,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:42,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:06:42,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:42,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:06:42,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:06:42,679 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:42,976 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2025-02-06 10:06:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:06:42,977 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 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 11 [2025-02-06 10:06:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:42,977 INFO L225 Difference]: With dead ends: 61 [2025-02-06 10:06:42,977 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 10:06:42,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:06:42,978 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:42,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 159 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 10:06:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2025-02-06 10:06:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-02-06 10:06:42,980 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2025-02-06 10:06:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:42,980 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-02-06 10:06:42,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-02-06 10:06:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:06:42,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:42,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:42,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:06:43,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:43,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:43,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2056399218, now seen corresponding path program 1 times [2025-02-06 10:06:43,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:43,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641130010] [2025-02-06 10:06:43,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:43,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:06:43,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:06:43,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:43,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:43,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:43,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641130010] [2025-02-06 10:06:43,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641130010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:43,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:43,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785088469] [2025-02-06 10:06:43,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:43,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:43,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:43,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:43,272 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:43,304 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-02-06 10:06:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:43,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:06:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:43,304 INFO L225 Difference]: With dead ends: 38 [2025-02-06 10:06:43,304 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 10:06:43,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:06:43,305 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 61 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:43,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 61 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 10:06:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 10:06:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-02-06 10:06:43,306 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 12 [2025-02-06 10:06:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:43,307 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-02-06 10:06:43,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-02-06 10:06:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:06:43,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:43,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:43,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:06:43,307 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:43,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2056399219, now seen corresponding path program 1 times [2025-02-06 10:06:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957490793] [2025-02-06 10:06:43,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:43,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:06:43,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:06:43,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:43,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957490793] [2025-02-06 10:06:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957490793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:43,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:06:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079341104] [2025-02-06 10:06:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:43,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:06:43,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:43,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:06:43,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:06:43,413 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:43,464 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-02-06 10:06:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:06:43,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:06:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:43,465 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:06:43,465 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:06:43,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:06:43,465 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:43,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:06:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2025-02-06 10:06:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-02-06 10:06:43,467 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2025-02-06 10:06:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:43,467 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-02-06 10:06:43,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-02-06 10:06:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:06:43,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:43,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:43,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:06:43,472 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:43,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1224420675, now seen corresponding path program 1 times [2025-02-06 10:06:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359698603] [2025-02-06 10:06:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:43,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:06:43,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:06:43,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:43,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359698603] [2025-02-06 10:06:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359698603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:06:43,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480109347] [2025-02-06 10:06:43,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:43,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:06:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:43,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:06:43,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:06:43,528 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:43,571 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-02-06 10:06:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:06:43,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:06:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:43,572 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:06:43,572 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:06:43,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:06:43,572 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:43,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 71 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:06:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-02-06 10:06:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-02-06 10:06:43,574 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 15 [2025-02-06 10:06:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:43,574 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-02-06 10:06:43,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-02-06 10:06:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:06:43,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:43,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:43,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:06:43,575 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:43,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1224420674, now seen corresponding path program 1 times [2025-02-06 10:06:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037959954] [2025-02-06 10:06:43,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:43,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:06:43,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:06:43,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:43,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037959954] [2025-02-06 10:06:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037959954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:43,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:43,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:06:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535222273] [2025-02-06 10:06:43,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:06:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:43,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:06:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:06:43,685 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:43,757 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-02-06 10:06:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:06:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:06:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:43,758 INFO L225 Difference]: With dead ends: 45 [2025-02-06 10:06:43,758 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 10:06:43,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:06:43,758 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:43,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 10:06:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-02-06 10:06:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-02-06 10:06:43,760 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 15 [2025-02-06 10:06:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:43,760 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-02-06 10:06:43,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-02-06 10:06:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:06:43,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:43,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:43,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:06:43,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:43,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash 782876407, now seen corresponding path program 1 times [2025-02-06 10:06:43,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:43,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763178998] [2025-02-06 10:06:43,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:43,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:06:43,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:06:43,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:43,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:43,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763178998] [2025-02-06 10:06:43,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763178998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:43,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:43,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:06:43,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89065551] [2025-02-06 10:06:43,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:43,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:43,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:43,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:43,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:43,882 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:43,896 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-02-06 10:06:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:43,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:06:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:43,896 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:06:43,897 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 10:06:43,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:43,897 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:43,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 10:06:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 10:06:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-02-06 10:06:43,898 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2025-02-06 10:06:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:43,899 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-02-06 10:06:43,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-02-06 10:06:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:06:43,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:43,899 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:43,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:06:43,899 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:43,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1500603991, now seen corresponding path program 1 times [2025-02-06 10:06:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:43,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149225007] [2025-02-06 10:06:43,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:43,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:06:43,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:06:43,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:43,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:44,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149225007] [2025-02-06 10:06:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149225007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:44,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:44,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:06:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797801512] [2025-02-06 10:06:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:44,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:06:44,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:44,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:06:44,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:06:44,044 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:44,110 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-02-06 10:06:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:06:44,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:06:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:44,111 INFO L225 Difference]: With dead ends: 52 [2025-02-06 10:06:44,111 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 10:06:44,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:06:44,111 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:44,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 145 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 10:06:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-02-06 10:06:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-06 10:06:44,112 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2025-02-06 10:06:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:44,112 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-06 10:06:44,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-06 10:06:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:06:44,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:44,113 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:44,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:06:44,113 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:44,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1500602838, now seen corresponding path program 1 times [2025-02-06 10:06:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515832899] [2025-02-06 10:06:44,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:44,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:06:44,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:06:44,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:44,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:44,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:44,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515832899] [2025-02-06 10:06:44,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515832899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:44,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:44,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:06:44,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374626768] [2025-02-06 10:06:44,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:44,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:06:44,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:44,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:06:44,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:06:44,246 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:44,293 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-02-06 10:06:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:06:44,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:06:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:44,294 INFO L225 Difference]: With dead ends: 80 [2025-02-06 10:06:44,294 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 10:06:44,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:06:44,294 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:44,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 10:06:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-02-06 10:06:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 64 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-02-06 10:06:44,296 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2025-02-06 10:06:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:44,296 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-02-06 10:06:44,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-02-06 10:06:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:06:44,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:44,297 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:44,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:06:44,298 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:44,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -147294294, now seen corresponding path program 1 times [2025-02-06 10:06:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:44,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280931769] [2025-02-06 10:06:44,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:44,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:44,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:06:44,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:06:44,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:44,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280931769] [2025-02-06 10:06:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280931769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:44,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:44,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 10:06:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614228695] [2025-02-06 10:06:44,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:44,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:06:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:44,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:06:44,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:06:44,438 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:44,515 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-02-06 10:06:44,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:06:44,515 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:06:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:44,516 INFO L225 Difference]: With dead ends: 96 [2025-02-06 10:06:44,516 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:06:44,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:06:44,516 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:44,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:06:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2025-02-06 10:06:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-02-06 10:06:44,518 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 20 [2025-02-06 10:06:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:44,518 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-02-06 10:06:44,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-02-06 10:06:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:06:44,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:44,519 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:44,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:06:44,519 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:44,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1797292105, now seen corresponding path program 1 times [2025-02-06 10:06:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657269843] [2025-02-06 10:06:44,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:44,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:44,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:06:44,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:06:44,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:44,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:44,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:44,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657269843] [2025-02-06 10:06:44,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657269843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:44,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:44,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:06:44,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384444629] [2025-02-06 10:06:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:44,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:06:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:44,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:06:44,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:06:44,730 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:44,833 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-02-06 10:06:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:06:44,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:06:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:44,836 INFO L225 Difference]: With dead ends: 103 [2025-02-06 10:06:44,836 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 10:06:44,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:06:44,837 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:44,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 136 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 10:06:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2025-02-06 10:06:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-02-06 10:06:44,839 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 20 [2025-02-06 10:06:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:44,839 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-02-06 10:06:44,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2025-02-06 10:06:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:06:44,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:44,840 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:44,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:06:44,840 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:44,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -383963815, now seen corresponding path program 1 times [2025-02-06 10:06:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734524461] [2025-02-06 10:06:44,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:44,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:06:44,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:06:44,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:44,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734524461] [2025-02-06 10:06:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734524461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197180223] [2025-02-06 10:06:45,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:45,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:45,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:45,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:06:45,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:06:45,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:06:45,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:45,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:45,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:06:45,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:45,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:45,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:06:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197180223] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:45,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:45,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-02-06 10:06:45,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326458571] [2025-02-06 10:06:45,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:45,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:06:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:45,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:06:45,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:06:45,450 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:45,678 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2025-02-06 10:06:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:06:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:06:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:45,679 INFO L225 Difference]: With dead ends: 88 [2025-02-06 10:06:45,679 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 10:06:45,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:06:45,680 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 53 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:45,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 246 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 10:06:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2025-02-06 10:06:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2025-02-06 10:06:45,681 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 23 [2025-02-06 10:06:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:45,681 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2025-02-06 10:06:45,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2025-02-06 10:06:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:06:45,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:45,682 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:45,692 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-02-06 10:06:45,888 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,SelfDestructingSolverStorable22 [2025-02-06 10:06:45,888 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:45,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 900666, now seen corresponding path program 1 times [2025-02-06 10:06:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:45,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028868167] [2025-02-06 10:06:45,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:45,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:06:45,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:06:45,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:45,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:46,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:46,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028868167] [2025-02-06 10:06:46,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028868167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:46,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436485074] [2025-02-06 10:06:46,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:46,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:46,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:46,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:46,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:06:46,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:06:46,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:06:46,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:46,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:46,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:06:46,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:46,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:46,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:06:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436485074] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:46,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:46,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-02-06 10:06:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121707764] [2025-02-06 10:06:46,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:46,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:06:46,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:46,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:06:46,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:06:46,333 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:46,460 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2025-02-06 10:06:46,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:06:46,461 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:06:46,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:46,461 INFO L225 Difference]: With dead ends: 107 [2025-02-06 10:06:46,461 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 10:06:46,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:06:46,462 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:46,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 242 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 10:06:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2025-02-06 10:06:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.17) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2025-02-06 10:06:46,467 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 23 [2025-02-06 10:06:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:46,467 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2025-02-06 10:06:46,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2025-02-06 10:06:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:06:46,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:46,467 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:46,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:06:46,668 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,SelfDestructingSolverStorable23 [2025-02-06 10:06:46,668 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:46,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1608669202, now seen corresponding path program 2 times [2025-02-06 10:06:46,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:46,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80833655] [2025-02-06 10:06:46,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:46,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:46,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 10:06:46,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:06:46,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:46,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:47,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:47,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80833655] [2025-02-06 10:06:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80833655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:47,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750680016] [2025-02-06 10:06:47,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:47,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:47,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:47,059 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:47,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:06:47,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 10:06:47,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:06:47,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:47,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:47,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:06:47,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:47,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:06:47,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:06:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:47,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:47,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:06:47,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:06:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:47,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750680016] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:47,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:47,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 13] total 35 [2025-02-06 10:06:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554900956] [2025-02-06 10:06:47,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:47,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:06:47,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:47,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:06:47,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:06:47,558 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:48,216 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2025-02-06 10:06:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-06 10:06:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 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 28 [2025-02-06 10:06:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:48,217 INFO L225 Difference]: With dead ends: 183 [2025-02-06 10:06:48,217 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 10:06:48,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=3666, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 10:06:48,219 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 104 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:48,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 337 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 10:06:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2025-02-06 10:06:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 138 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2025-02-06 10:06:48,222 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 28 [2025-02-06 10:06:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:48,222 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2025-02-06 10:06:48,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2025-02-06 10:06:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:06:48,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:48,223 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:48,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:06:48,423 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,SelfDestructingSolverStorable24 [2025-02-06 10:06:48,423 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:48,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 725958301, now seen corresponding path program 3 times [2025-02-06 10:06:48,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:48,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457538108] [2025-02-06 10:06:48,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:48,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-02-06 10:06:48,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:06:48,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:06:48,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457538108] [2025-02-06 10:06:48,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457538108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256520964] [2025-02-06 10:06:48,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:48,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:48,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:48,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:48,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:06:48,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-02-06 10:06:48,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:06:48,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:06:48,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:48,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 10:06:48,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:48,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:49,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-06 10:06:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:49,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256520964] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:49,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:49,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2025-02-06 10:06:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833494241] [2025-02-06 10:06:49,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:49,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:06:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:49,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:06:49,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:06:49,108 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:49,378 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2025-02-06 10:06:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:06:49,378 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 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 31 [2025-02-06 10:06:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:49,379 INFO L225 Difference]: With dead ends: 167 [2025-02-06 10:06:49,379 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 10:06:49,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:06:49,379 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 119 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:49,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 232 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 10:06:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2025-02-06 10:06:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2025-02-06 10:06:49,385 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 31 [2025-02-06 10:06:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:49,385 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2025-02-06 10:06:49,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2025-02-06 10:06:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:06:49,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:49,386 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:49,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:06:49,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:49,587 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:49,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1382579185, now seen corresponding path program 2 times [2025-02-06 10:06:49,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:49,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746363026] [2025-02-06 10:06:49,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:49,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:49,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 10:06:49,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:06:49,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:49,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:49,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:49,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746363026] [2025-02-06 10:06:49,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746363026] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:49,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222722956] [2025-02-06 10:06:49,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:49,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:49,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:49,947 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:49,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:06:49,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 10:06:50,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:06:50,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:50,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:50,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 10:06:50,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:50,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:06:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:50,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:50,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:06:50,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:06:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222722956] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:50,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 34 [2025-02-06 10:06:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166859006] [2025-02-06 10:06:50,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:50,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:06:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:50,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:06:50,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:06:50,456 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:50,759 INFO L93 Difference]: Finished difference Result 278 states and 304 transitions. [2025-02-06 10:06:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:06:50,760 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 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 31 [2025-02-06 10:06:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:50,760 INFO L225 Difference]: With dead ends: 278 [2025-02-06 10:06:50,760 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 10:06:50,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=1592, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 10:06:50,761 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:50,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 389 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 10:06:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2025-02-06 10:06:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 1.148936170212766) internal successors, (216), 189 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2025-02-06 10:06:50,771 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 31 [2025-02-06 10:06:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:50,771 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2025-02-06 10:06:50,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2025-02-06 10:06:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:06:50,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:50,772 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:50,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 10:06:50,972 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,SelfDestructingSolverStorable26 [2025-02-06 10:06:50,973 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:50,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -369111712, now seen corresponding path program 3 times [2025-02-06 10:06:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:50,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837958256] [2025-02-06 10:06:50,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:50,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-02-06 10:06:50,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:06:50,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:06:50,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:51,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:51,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837958256] [2025-02-06 10:06:51,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837958256] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:51,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164050028] [2025-02-06 10:06:51,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:51,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:51,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:51,284 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:51,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:06:51,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-02-06 10:06:51,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:06:51,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:06:51,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:51,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 10:06:51,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:51,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 10:06:51,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:51,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:06:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:51,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164050028] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:51,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:51,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-02-06 10:06:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47329017] [2025-02-06 10:06:51,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:51,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:06:51,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:51,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:06:51,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:06:51,695 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:51,911 INFO L93 Difference]: Finished difference Result 233 states and 262 transitions. [2025-02-06 10:06:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:06:51,912 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-06 10:06:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:51,912 INFO L225 Difference]: With dead ends: 233 [2025-02-06 10:06:51,912 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 10:06:51,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:06:51,914 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:51,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 474 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 10:06:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-02-06 10:06:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 229 states have (on average 1.1441048034934498) internal successors, (262), 230 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 262 transitions. [2025-02-06 10:06:51,920 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 262 transitions. Word has length 34 [2025-02-06 10:06:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 262 transitions. [2025-02-06 10:06:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 262 transitions. [2025-02-06 10:06:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:06:51,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:51,924 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:51,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:06:52,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:52,125 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:52,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:52,127 INFO L85 PathProgramCache]: Analyzing trace with hash -312360662, now seen corresponding path program 4 times [2025-02-06 10:06:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:52,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122222123] [2025-02-06 10:06:52,127 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:06:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:52,133 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:06:52,140 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-02-06 10:06:52,140 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:06:52,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:52,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:52,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122222123] [2025-02-06 10:06:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122222123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:52,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883548306] [2025-02-06 10:06:52,623 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:06:52,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:52,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:52,625 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:52,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:06:52,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:06:52,689 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-02-06 10:06:52,689 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:06:52,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:52,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-06 10:06:52,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:52,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:06:52,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:06:53,530 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-02-06 10:06:53,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 26 [2025-02-06 10:06:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:53,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:53,814 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 48 treesize of output 42 [2025-02-06 10:06:53,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:06:53,818 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 56 treesize of output 46 [2025-02-06 10:06:53,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-02-06 10:06:53,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 10:06:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:54,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883548306] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:54,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:54,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 56 [2025-02-06 10:06:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364526148] [2025-02-06 10:06:54,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:54,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-06 10:06:54,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:54,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-06 10:06:54,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2841, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 10:06:54,113 INFO L87 Difference]: Start difference. First operand 231 states and 262 transitions. Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:55,937 INFO L93 Difference]: Finished difference Result 395 states and 436 transitions. [2025-02-06 10:06:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-06 10:06:55,938 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-06 10:06:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:55,939 INFO L225 Difference]: With dead ends: 395 [2025-02-06 10:06:55,939 INFO L226 Difference]: Without dead ends: 325 [2025-02-06 10:06:55,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3332 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=743, Invalid=9357, Unknown=0, NotChecked=0, Total=10100 [2025-02-06 10:06:55,944 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 98 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:55,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 432 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:06:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-06 10:06:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 299. [2025-02-06 10:06:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.138047138047138) internal successors, (338), 298 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 338 transitions. [2025-02-06 10:06:55,953 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 338 transitions. Word has length 36 [2025-02-06 10:06:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:55,953 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 338 transitions. [2025-02-06 10:06:55,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 338 transitions. [2025-02-06 10:06:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:06:55,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:55,954 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:55,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 10:06:56,154 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,SelfDestructingSolverStorable28 [2025-02-06 10:06:56,154 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:56,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -715441959, now seen corresponding path program 5 times [2025-02-06 10:06:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401674974] [2025-02-06 10:06:56,155 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:06:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:56,162 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-02-06 10:06:56,169 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:06:56,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:06:56,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:56,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401674974] [2025-02-06 10:06:56,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401674974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:56,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619640270] [2025-02-06 10:06:56,379 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:06:56,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:56,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:56,381 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:56,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:06:56,449 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-02-06 10:06:56,472 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:06:56,473 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:06:56,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:56,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 10:06:56,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:56,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 10:06:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:56,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:56,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619640270] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:56,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:56,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34 [2025-02-06 10:06:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207210918] [2025-02-06 10:06:56,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:56,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:06:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:56,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:06:56,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:06:56,993 INFO L87 Difference]: Start difference. First operand 299 states and 338 transitions. Second operand has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:57,417 INFO L93 Difference]: Finished difference Result 358 states and 400 transitions. [2025-02-06 10:06:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:06:57,418 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 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 39 [2025-02-06 10:06:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:57,419 INFO L225 Difference]: With dead ends: 358 [2025-02-06 10:06:57,419 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 10:06:57,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1671, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:06:57,420 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 90 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:57,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 557 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:06:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 10:06:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 324. [2025-02-06 10:06:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 322 states have (on average 1.139751552795031) internal successors, (367), 323 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 367 transitions. [2025-02-06 10:06:57,427 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 367 transitions. Word has length 39 [2025-02-06 10:06:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:57,427 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 367 transitions. [2025-02-06 10:06:57,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 367 transitions. [2025-02-06 10:06:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:06:57,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:57,432 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:57,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 10:06:57,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:57,632 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:06:57,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 788792599, now seen corresponding path program 4 times [2025-02-06 10:06:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:57,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144551798] [2025-02-06 10:06:57,633 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:06:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:57,638 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-06 10:06:57,648 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 42 statements. [2025-02-06 10:06:57,648 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:06:57,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:06:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:58,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144551798] [2025-02-06 10:06:58,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144551798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:58,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729753105] [2025-02-06 10:06:58,711 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:06:58,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:58,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:58,713 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:06:58,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:06:58,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-06 10:06:58,781 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 42 statements. [2025-02-06 10:06:58,781 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:06:58,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:58,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-06 10:06:58,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:58,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:07:00,009 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-06 10:07:00,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2025-02-06 10:07:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:00,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:01,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-06 10:07:01,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2025-02-06 10:07:01,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:07:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:07:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729753105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:01,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:01,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 56 [2025-02-06 10:07:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978040175] [2025-02-06 10:07:01,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:01,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-06 10:07:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:01,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-06 10:07:01,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2897, Unknown=0, NotChecked=0, Total=3192 [2025-02-06 10:07:01,153 INFO L87 Difference]: Start difference. First operand 324 states and 367 transitions. Second operand has 57 states, 56 states have (on average 1.75) internal successors, (98), 57 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:01,972 INFO L93 Difference]: Finished difference Result 350 states and 389 transitions. [2025-02-06 10:07:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:07:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.75) internal successors, (98), 57 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-06 10:07:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:01,973 INFO L225 Difference]: With dead ends: 350 [2025-02-06 10:07:01,973 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:07:01,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=486, Invalid=3804, Unknown=0, NotChecked=0, Total=4290 [2025-02-06 10:07:01,974 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:01,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 400 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:07:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:07:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 130. [2025-02-06 10:07:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.1317829457364341) internal successors, (146), 129 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-02-06 10:07:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2025-02-06 10:07:01,977 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 42 [2025-02-06 10:07:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:01,977 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2025-02-06 10:07:01,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.75) internal successors, (98), 57 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2025-02-06 10:07:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:07:01,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:01,978 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:01,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 10:07:02,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:02,178 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:02,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1247464558, now seen corresponding path program 6 times [2025-02-06 10:07:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992736380] [2025-02-06 10:07:02,179 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:07:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:02,184 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 5 equivalence classes. [2025-02-06 10:07:02,192 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:07:02,192 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:07:02,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:02,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:02,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992736380] [2025-02-06 10:07:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992736380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:02,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802967083] [2025-02-06 10:07:02,636 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:07:02,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:02,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:02,638 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:02,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:07:02,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 5 equivalence classes. [2025-02-06 10:07:02,715 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:07:02,716 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:07:02,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:02,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-02-06 10:07:02,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:02,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:07:02,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:07:03,025 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:07:03,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:07:03,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-02-06 10:07:03,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:07:03,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:07:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:03,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:04,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-06 10:07:04,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:04,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:07:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:04,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802967083] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:04,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:04,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 19] total 60 [2025-02-06 10:07:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576354387] [2025-02-06 10:07:04,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:04,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-06 10:07:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:04,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-06 10:07:04,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3287, Unknown=0, NotChecked=0, Total=3540 [2025-02-06 10:07:04,415 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand has 60 states, 60 states have (on average 2.1) internal successors, (126), 60 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:09,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:07:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:14,677 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2025-02-06 10:07:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-06 10:07:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.1) internal successors, (126), 60 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-06 10:07:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:14,678 INFO L225 Difference]: With dead ends: 232 [2025-02-06 10:07:14,678 INFO L226 Difference]: Without dead ends: 207 [2025-02-06 10:07:14,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=814, Invalid=9488, Unknown=0, NotChecked=0, Total=10302 [2025-02-06 10:07:14,682 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 139 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:14,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 502 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1409 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 10:07:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-06 10:07:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 148. [2025-02-06 10:07:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.129251700680272) internal successors, (166), 147 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2025-02-06 10:07:14,687 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 44 [2025-02-06 10:07:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:14,687 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2025-02-06 10:07:14,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.1) internal successors, (126), 60 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2025-02-06 10:07:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:07:14,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:14,691 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:14,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 10:07:14,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:14,895 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:14,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1759204410, now seen corresponding path program 1 times [2025-02-06 10:07:14,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:14,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924881071] [2025-02-06 10:07:14,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:14,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:14,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:07:14,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:07:14,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:14,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924881071] [2025-02-06 10:07:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924881071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649027512] [2025-02-06 10:07:15,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:07:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:15,383 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:15,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:07:15,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:07:15,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:07:15,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:15,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:15,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 10:07:15,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:15,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:07:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:07:15,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:15,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:15,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:07:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:07:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649027512] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:15,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:15,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 37 [2025-02-06 10:07:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311204882] [2025-02-06 10:07:15,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:15,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:07:15,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:15,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:07:15,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:07:15,925 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand has 37 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:16,809 INFO L93 Difference]: Finished difference Result 269 states and 294 transitions. [2025-02-06 10:07:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:07:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-06 10:07:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:16,810 INFO L225 Difference]: With dead ends: 269 [2025-02-06 10:07:16,810 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 10:07:16,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=2843, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 10:07:16,811 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 87 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:16,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 588 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:07:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 10:07:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2025-02-06 10:07:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 153 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2025-02-06 10:07:16,814 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 49 [2025-02-06 10:07:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:16,814 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2025-02-06 10:07:16,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2025-02-06 10:07:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:07:16,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:16,815 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:16,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 10:07:17,019 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,SelfDestructingSolverStorable32 [2025-02-06 10:07:17,019 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:17,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash 123595434, now seen corresponding path program 7 times [2025-02-06 10:07:17,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:17,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41918128] [2025-02-06 10:07:17,019 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:07:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:17,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:07:17,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:07:17,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:17,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:17,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41918128] [2025-02-06 10:07:17,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41918128] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:17,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95349879] [2025-02-06 10:07:17,356 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:07:17,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:17,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:17,358 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:17,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:07:17,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:07:17,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:07:17,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:17,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:17,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:07:17,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:17,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:07:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:17,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:17,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:17,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:07:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95349879] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:17,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:17,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 33 [2025-02-06 10:07:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178497829] [2025-02-06 10:07:17,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:17,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:07:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:17,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:07:17,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:07:17,842 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:18,303 INFO L93 Difference]: Finished difference Result 283 states and 310 transitions. [2025-02-06 10:07:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:07:18,303 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-06 10:07:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:18,304 INFO L225 Difference]: With dead ends: 283 [2025-02-06 10:07:18,304 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 10:07:18,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1978, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 10:07:18,305 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 64 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:18,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 681 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:07:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 10:07:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2025-02-06 10:07:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.117283950617284) internal successors, (181), 162 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2025-02-06 10:07:18,307 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 52 [2025-02-06 10:07:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:18,308 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2025-02-06 10:07:18,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2025-02-06 10:07:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 10:07:18,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:18,308 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:18,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:07:18,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:18,514 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:18,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash -139975591, now seen corresponding path program 8 times [2025-02-06 10:07:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533178556] [2025-02-06 10:07:18,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:18,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-06 10:07:18,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:07:18,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:18,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533178556] [2025-02-06 10:07:18,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533178556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945727416] [2025-02-06 10:07:18,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:18,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:18,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:18,894 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:18,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:07:18,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-06 10:07:18,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:07:18,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:18,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:18,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-06 10:07:18,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:19,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:19,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:07:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945727416] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:19,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 38 [2025-02-06 10:07:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807619707] [2025-02-06 10:07:19,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:19,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-06 10:07:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:19,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-06 10:07:19,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1328, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 10:07:19,594 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 39 states, 38 states have (on average 2.973684210526316) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:20,209 INFO L93 Difference]: Finished difference Result 205 states and 225 transitions. [2025-02-06 10:07:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:07:20,210 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.973684210526316) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-06 10:07:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:20,210 INFO L225 Difference]: With dead ends: 205 [2025-02-06 10:07:20,210 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 10:07:20,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=2359, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 10:07:20,211 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 127 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:20,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 666 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:07:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 10:07:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 178. [2025-02-06 10:07:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.11864406779661) internal successors, (198), 177 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2025-02-06 10:07:20,214 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 55 [2025-02-06 10:07:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:20,214 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2025-02-06 10:07:20,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.973684210526316) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2025-02-06 10:07:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 10:07:20,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:20,215 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:20,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-06 10:07:20,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:20,415 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:20,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1797975826, now seen corresponding path program 9 times [2025-02-06 10:07:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:20,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654435093] [2025-02-06 10:07:20,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:20,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:20,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 7 equivalence classes. [2025-02-06 10:07:20,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 10:07:20,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 10:07:20,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:20,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654435093] [2025-02-06 10:07:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654435093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:20,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191512048] [2025-02-06 10:07:20,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:20,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:20,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:20,857 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:20,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:07:20,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 7 equivalence classes. [2025-02-06 10:07:20,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 10:07:20,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 10:07:20,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:20,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-02-06 10:07:20,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:21,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:07:21,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:07:21,419 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:07:21,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:07:21,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-02-06 10:07:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:21,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:22,213 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 19 treesize of output 17 [2025-02-06 10:07:22,218 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 28 treesize of output 24 [2025-02-06 10:07:22,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-02-06 10:07:22,320 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 20 [2025-02-06 10:07:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191512048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:22,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:22,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 26] total 71 [2025-02-06 10:07:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185771674] [2025-02-06 10:07:22,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:22,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-02-06 10:07:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:22,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-02-06 10:07:22,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=4747, Unknown=0, NotChecked=0, Total=4970 [2025-02-06 10:07:22,885 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand has 71 states, 71 states have (on average 2.380281690140845) internal successors, (169), 71 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:25,229 INFO L93 Difference]: Finished difference Result 385 states and 417 transitions. [2025-02-06 10:07:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-02-06 10:07:25,229 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.380281690140845) internal successors, (169), 71 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-06 10:07:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:25,230 INFO L225 Difference]: With dead ends: 385 [2025-02-06 10:07:25,230 INFO L226 Difference]: Without dead ends: 215 [2025-02-06 10:07:25,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3590 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=600, Invalid=13442, Unknown=0, NotChecked=0, Total=14042 [2025-02-06 10:07:25,231 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 130 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 2448 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:25,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1286 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:07:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-06 10:07:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 187. [2025-02-06 10:07:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.1129032258064515) internal successors, (207), 186 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2025-02-06 10:07:25,234 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 60 [2025-02-06 10:07:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:25,234 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2025-02-06 10:07:25,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.380281690140845) internal successors, (169), 71 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2025-02-06 10:07:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 10:07:25,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:25,235 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:25,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:07:25,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:25,439 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:25,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:25,440 INFO L85 PathProgramCache]: Analyzing trace with hash 849226653, now seen corresponding path program 10 times [2025-02-06 10:07:25,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:25,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596649714] [2025-02-06 10:07:25,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:25,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:25,449 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-02-06 10:07:25,467 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 63 statements. [2025-02-06 10:07:25,467 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:07:25,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596649714] [2025-02-06 10:07:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596649714] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429870766] [2025-02-06 10:07:27,359 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:27,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:27,362 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:27,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:07:27,428 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-02-06 10:07:27,457 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 63 statements. [2025-02-06 10:07:27,458 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:07:27,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:27,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-02-06 10:07:27,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:27,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:07:27,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:07:30,441 INFO L349 Elim1Store]: treesize reduction 20, result has 69.7 percent of original size [2025-02-06 10:07:30,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2025-02-06 10:07:30,448 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-06 10:07:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 25 proven. 62 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 10:07:30,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:33,655 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 93 treesize of output 81 [2025-02-06 10:07:33,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 127 [2025-02-06 10:07:33,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:07:33,682 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-06 10:07:33,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-02-06 10:07:33,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 10:07:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 10:07:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429870766] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:34,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:34,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 101 [2025-02-06 10:07:34,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766719273] [2025-02-06 10:07:34,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:34,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-02-06 10:07:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:34,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-02-06 10:07:34,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=9783, Unknown=0, NotChecked=0, Total=10302 [2025-02-06 10:07:34,059 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand has 102 states, 101 states have (on average 1.504950495049505) internal successors, (152), 102 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:44,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:07:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:50,194 INFO L93 Difference]: Finished difference Result 291 states and 316 transitions. [2025-02-06 10:07:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-02-06 10:07:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 101 states have (on average 1.504950495049505) internal successors, (152), 102 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-06 10:07:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:50,195 INFO L225 Difference]: With dead ends: 291 [2025-02-06 10:07:50,195 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 10:07:50,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9398 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1928, Invalid=37078, Unknown=0, NotChecked=0, Total=39006 [2025-02-06 10:07:50,197 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 132 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3800 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:50,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 417 Invalid, 3845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3800 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-06 10:07:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 10:07:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 199. [2025-02-06 10:07:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.1111111111111112) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2025-02-06 10:07:50,208 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 63 [2025-02-06 10:07:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:50,208 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2025-02-06 10:07:50,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 101 states have (on average 1.504950495049505) internal successors, (152), 102 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2025-02-06 10:07:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:07:50,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:50,209 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:50,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:07:50,409 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,SelfDestructingSolverStorable36 [2025-02-06 10:07:50,409 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:50,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1815839671, now seen corresponding path program 2 times [2025-02-06 10:07:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:50,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354180076] [2025-02-06 10:07:50,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:50,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 10:07:50,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:07:50,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:50,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354180076] [2025-02-06 10:07:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354180076] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891929763] [2025-02-06 10:07:50,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:50,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:50,855 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:50,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:07:50,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 10:07:50,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:07:50,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:50,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:50,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-02-06 10:07:50,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:51,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:07:51,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:07:51,418 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:07:51,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:07:51,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-02-06 10:07:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:51,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:51,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:07:51,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:07:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:51,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891929763] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:51,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:51,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28, 25] total 55 [2025-02-06 10:07:51,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165409253] [2025-02-06 10:07:51,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:51,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 10:07:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:51,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 10:07:51,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2791, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 10:07:51,975 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 55 states, 55 states have (on average 2.290909090909091) internal successors, (126), 55 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:53,909 INFO L93 Difference]: Finished difference Result 373 states and 407 transitions. [2025-02-06 10:07:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-06 10:07:53,909 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.290909090909091) internal successors, (126), 55 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 10:07:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:53,910 INFO L225 Difference]: With dead ends: 373 [2025-02-06 10:07:53,910 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 10:07:53,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=595, Invalid=9707, Unknown=0, NotChecked=0, Total=10302 [2025-02-06 10:07:53,911 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 170 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:53,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1221 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:07:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 10:07:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2025-02-06 10:07:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.106280193236715) internal successors, (229), 207 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 229 transitions. [2025-02-06 10:07:53,915 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 229 transitions. Word has length 68 [2025-02-06 10:07:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:53,915 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 229 transitions. [2025-02-06 10:07:53,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.290909090909091) internal successors, (126), 55 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 229 transitions. [2025-02-06 10:07:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 10:07:53,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:53,916 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:53,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-06 10:07:54,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:54,120 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:54,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash 767393626, now seen corresponding path program 3 times [2025-02-06 10:07:54,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:54,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388289675] [2025-02-06 10:07:54,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:54,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:54,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 8 equivalence classes. [2025-02-06 10:07:54,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:07:54,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 10:07:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 35 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388289675] [2025-02-06 10:07:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388289675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:54,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550042959] [2025-02-06 10:07:54,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:54,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:54,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:54,608 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:54,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:07:54,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 8 equivalence classes. [2025-02-06 10:07:54,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:07:54,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 10:07:54,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:54,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-06 10:07:54,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 51 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:55,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:55,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-06 10:07:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 51 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550042959] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:55,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:55,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 48 [2025-02-06 10:07:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756946561] [2025-02-06 10:07:55,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:55,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:07:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:55,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:07:55,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2069, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 10:07:55,582 INFO L87 Difference]: Start difference. First operand 208 states and 229 transitions. Second operand has 49 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 49 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:56,234 INFO L93 Difference]: Finished difference Result 262 states and 285 transitions. [2025-02-06 10:07:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 10:07:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 49 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 10:07:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:56,235 INFO L225 Difference]: With dead ends: 262 [2025-02-06 10:07:56,235 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 10:07:56,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1687 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=3660, Unknown=0, NotChecked=0, Total=4290 [2025-02-06 10:07:56,236 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 156 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:56,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 236 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:07:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 10:07:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 223. [2025-02-06 10:07:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.1081081081081081) internal successors, (246), 222 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 246 transitions. [2025-02-06 10:07:56,240 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 246 transitions. Word has length 71 [2025-02-06 10:07:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:56,240 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 246 transitions. [2025-02-06 10:07:56,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 49 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 246 transitions. [2025-02-06 10:07:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 10:07:56,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:56,240 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:56,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-06 10:07:56,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-02-06 10:07:56,441 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:07:56,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash 781545101, now seen corresponding path program 4 times [2025-02-06 10:07:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:56,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400194108] [2025-02-06 10:07:56,441 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:56,449 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-02-06 10:07:56,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 67 of 76 statements. [2025-02-06 10:07:56,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:07:56,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 156 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400194108] [2025-02-06 10:07:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400194108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312943415] [2025-02-06 10:07:58,522 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:58,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:58,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:58,525 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:58,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:07:58,601 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-02-06 10:07:58,635 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 67 of 76 statements. [2025-02-06 10:07:58,635 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:07:58,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:58,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-06 10:07:58,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:58,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:08:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 128 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:01,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:01,484 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 119 treesize of output 103 [2025-02-06 10:08:01,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:01,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 119 treesize of output 89 [2025-02-06 10:08:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 156 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:02,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312943415] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:02,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:02,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2025-02-06 10:08:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005667231] [2025-02-06 10:08:02,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:02,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2025-02-06 10:08:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:02,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2025-02-06 10:08:02,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=854, Invalid=7156, Unknown=0, NotChecked=0, Total=8010 [2025-02-06 10:08:02,366 INFO L87 Difference]: Start difference. First operand 223 states and 246 transitions. Second operand has 90 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 90 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:04,312 INFO L93 Difference]: Finished difference Result 376 states and 414 transitions. [2025-02-06 10:08:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 10:08:04,312 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 90 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-06 10:08:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:04,313 INFO L225 Difference]: With dead ends: 376 [2025-02-06 10:08:04,313 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 10:08:04,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5729 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1444, Invalid=13562, Unknown=0, NotChecked=0, Total=15006 [2025-02-06 10:08:04,314 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:04,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 184 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:08:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 10:08:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2025-02-06 10:08:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.103896103896104) internal successors, (255), 231 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 255 transitions. [2025-02-06 10:08:04,317 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 255 transitions. Word has length 76 [2025-02-06 10:08:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:04,317 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 255 transitions. [2025-02-06 10:08:04,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 90 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 255 transitions. [2025-02-06 10:08:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 10:08:04,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:04,317 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:04,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:04,517 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,SelfDestructingSolverStorable39 [2025-02-06 10:08:04,519 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:08:04,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1701236894, now seen corresponding path program 5 times [2025-02-06 10:08:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116058192] [2025-02-06 10:08:04,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:08:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:04,526 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 9 equivalence classes. [2025-02-06 10:08:04,534 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 10:08:04,535 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-02-06 10:08:04,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:05,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116058192] [2025-02-06 10:08:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116058192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391638457] [2025-02-06 10:08:05,070 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:08:05,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:05,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:05,074 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:05,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 10:08:05,157 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 9 equivalence classes. [2025-02-06 10:08:05,204 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 10:08:05,204 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-02-06 10:08:05,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:05,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-06 10:08:05,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:05,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 10:08:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:05,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:06,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391638457] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:06,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:06,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 70 [2025-02-06 10:08:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383257239] [2025-02-06 10:08:06,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:06,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-02-06 10:08:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:06,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-02-06 10:08:06,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=4472, Unknown=0, NotChecked=0, Total=4970 [2025-02-06 10:08:06,500 INFO L87 Difference]: Start difference. First operand 232 states and 255 transitions. Second operand has 71 states, 70 states have (on average 3.257142857142857) internal successors, (228), 71 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:07,590 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2025-02-06 10:08:07,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 10:08:07,591 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 3.257142857142857) internal successors, (228), 71 states have internal predecessors, (228), 0 states have call successors, (0), 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 79 [2025-02-06 10:08:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:07,591 INFO L225 Difference]: With dead ends: 292 [2025-02-06 10:08:07,591 INFO L226 Difference]: Without dead ends: 292 [2025-02-06 10:08:07,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=795, Invalid=7215, Unknown=0, NotChecked=0, Total=8010 [2025-02-06 10:08:07,593 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 273 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:07,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1215 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:08:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-06 10:08:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 247. [2025-02-06 10:08:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.1056910569105691) internal successors, (272), 246 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 272 transitions. [2025-02-06 10:08:07,597 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 272 transitions. Word has length 79 [2025-02-06 10:08:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:07,597 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 272 transitions. [2025-02-06 10:08:07,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 3.257142857142857) internal successors, (228), 71 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 272 transitions. [2025-02-06 10:08:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 10:08:07,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:07,598 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:07,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:07,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-02-06 10:08:07,802 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-02-06 10:08:07,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash 86001609, now seen corresponding path program 6 times [2025-02-06 10:08:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:07,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892216616] [2025-02-06 10:08:07,802 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:08:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:07,813 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 84 statements into 10 equivalence classes. [2025-02-06 10:08:07,841 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 10:08:07,842 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-02-06 10:08:07,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 51 proven. 239 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:09,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892216616] [2025-02-06 10:08:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892216616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743066596] [2025-02-06 10:08:09,052 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:08:09,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:09,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:09,054 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:09,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-06 10:08:09,129 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 84 statements into 10 equivalence classes. [2025-02-06 10:08:09,215 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 10:08:09,215 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-02-06 10:08:09,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:09,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-02-06 10:08:09,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:09,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:08:09,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:08:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:10,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:11,259 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 19 treesize of output 17 [2025-02-06 10:08:11,261 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 28 treesize of output 24 [2025-02-06 10:08:11,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-02-06 10:08:11,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 10:08:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743066596] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:11,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 83 [2025-02-06 10:08:11,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546585900] [2025-02-06 10:08:11,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:11,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-02-06 10:08:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:11,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-02-06 10:08:11,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=6527, Unknown=0, NotChecked=0, Total=6806 [2025-02-06 10:08:11,526 INFO L87 Difference]: Start difference. First operand 247 states and 272 transitions. Second operand has 83 states, 83 states have (on average 2.6626506024096384) internal successors, (221), 83 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)