./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/forester-heap/sll-buckets-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:40:46,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:40:46,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-06 09:40:46,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:40:46,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:40:46,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:40:46,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:40:46,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:40:46,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:40:46,758 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:40:46,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:40:46,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:40:46,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:40:46,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:40:46,760 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:40:46,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:40:46,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:40:46,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:40:46,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:40:46,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:40:46,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:40:46,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:40:46,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:40:46,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:40:46,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:40:46,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:40:46,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:40:46,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:40:46,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:40:46,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:40:46,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:40:46,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:40:46,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:40:46,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:40:46,763 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-memcleanup) ) 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 -> 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb [2025-02-06 09:40:47,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:40:47,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:40:47,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:40:47,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:40:47,041 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:40:47,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2025-02-06 09:40:48,274 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4cd374ad/a7e642e1cc144d0f89f4fe6da9fa6992/FLAG7224ff59c [2025-02-06 09:40:48,621 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:40:48,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2025-02-06 09:40:48,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4cd374ad/a7e642e1cc144d0f89f4fe6da9fa6992/FLAG7224ff59c [2025-02-06 09:40:48,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4cd374ad/a7e642e1cc144d0f89f4fe6da9fa6992 [2025-02-06 09:40:48,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:40:48,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:40:48,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:40:48,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:40:48,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:40:48,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:40:48" (1/1) ... [2025-02-06 09:40:48,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c541195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:48, skipping insertion in model container [2025-02-06 09:40:48,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:40:48" (1/1) ... [2025-02-06 09:40:48,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:40:49,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:40:49,179 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:40:49,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:40:49,243 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:40:49,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49 WrapperNode [2025-02-06 09:40:49,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:40:49,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:40:49,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:40:49,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:40:49,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,280 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2025-02-06 09:40:49,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:40:49,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:40:49,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:40:49,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:40:49,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,314 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2025-02-06 09:40:49,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,325 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:40:49,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:40:49,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:40:49,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:40:49,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (1/1) ... [2025-02-06 09:40:49,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:40:49,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:49,375 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 09:40:49,378 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 09:40:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 09:40:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:40:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:40:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:40:49,512 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:40:49,514 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:40:49,757 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-06 09:40:49,757 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:40:49,763 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:40:49,763 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:40:49,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:49 BoogieIcfgContainer [2025-02-06 09:40:49,764 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:40:49,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:40:49,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:40:49,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:40:49,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:40:48" (1/3) ... [2025-02-06 09:40:49,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da3acbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:40:49, skipping insertion in model container [2025-02-06 09:40:49,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:49" (2/3) ... [2025-02-06 09:40:49,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da3acbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:40:49, skipping insertion in model container [2025-02-06 09:40:49,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:49" (3/3) ... [2025-02-06 09:40:49,773 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2025-02-06 09:40:49,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:40:49,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-buckets-2.i that has 2 procedures, 53 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-02-06 09:40:49,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:40:49,840 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;@306c6766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:40:49,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 09:40:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 46 states have internal predecessors, (73), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 09:40:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 09:40:49,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:49,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 09:40:49,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:49,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash -953073205, now seen corresponding path program 1 times [2025-02-06 09:40:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:49,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678136715] [2025-02-06 09:40:49,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:50,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 09:40:50,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 09:40:50,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:50,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:50,245 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 09:40:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678136715] [2025-02-06 09:40:50,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678136715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:50,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:50,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:40:50,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563243364] [2025-02-06 09:40:50,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:50,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:40:50,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:50,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:40:50,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:40:50,287 INFO L87 Difference]: Start difference. First operand has 53 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 46 states have internal predecessors, (73), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:50,309 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2025-02-06 09:40:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:40:50,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 09:40:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:50,315 INFO L225 Difference]: With dead ends: 46 [2025-02-06 09:40:50,316 INFO L226 Difference]: Without dead ends: 44 [2025-02-06 09:40:50,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:40:50,323 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:50,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-06 09:40:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-06 09:40:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-02-06 09:40:50,369 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 6 [2025-02-06 09:40:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:50,369 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-02-06 09:40:50,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-02-06 09:40:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 09:40:50,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:50,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:50,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:40:50,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:50,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash 520029374, now seen corresponding path program 1 times [2025-02-06 09:40:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703522069] [2025-02-06 09:40:50,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:50,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 09:40:50,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 09:40:50,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:50,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:50,566 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 09:40:50,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:50,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703522069] [2025-02-06 09:40:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703522069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:50,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:40:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829687103] [2025-02-06 09:40:50,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:50,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:40:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:50,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:40:50,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:40:50,572 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:50,676 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2025-02-06 09:40:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:50,677 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 09:40:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:50,678 INFO L225 Difference]: With dead ends: 62 [2025-02-06 09:40:50,679 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 09:40:50,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:50,680 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:50,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 93 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:40:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 09:40:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2025-02-06 09:40:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2025-02-06 09:40:50,688 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 7 [2025-02-06 09:40:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:50,688 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2025-02-06 09:40:50,688 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 09:40:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2025-02-06 09:40:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 09:40:50,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:50,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:50,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:40:50,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:50,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash -64951687, now seen corresponding path program 1 times [2025-02-06 09:40:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:50,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156192594] [2025-02-06 09:40:50,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:50,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 09:40:50,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 09:40:50,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:50,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:51,175 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 09:40:51,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:51,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156192594] [2025-02-06 09:40:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156192594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:51,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:51,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:40:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965547119] [2025-02-06 09:40:51,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:51,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:51,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:51,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:51,176 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:51,335 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-02-06 09:40:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:40:51,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 09:40:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:51,336 INFO L225 Difference]: With dead ends: 54 [2025-02-06 09:40:51,336 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 09:40:51,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:51,337 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:51,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 121 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:40:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 09:40:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-02-06 09:40:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 50 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-02-06 09:40:51,345 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 12 [2025-02-06 09:40:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:51,345 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-02-06 09:40:51,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-02-06 09:40:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 09:40:51,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:51,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:51,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:40:51,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:51,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1393307270, now seen corresponding path program 1 times [2025-02-06 09:40:51,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:51,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131125702] [2025-02-06 09:40:51,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:51,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:51,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 09:40:51,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 09:40:51,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:51,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:51,530 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 09:40:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:51,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131125702] [2025-02-06 09:40:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131125702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:51,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958589210] [2025-02-06 09:40:51,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:51,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:51,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:51,535 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 09:40:51,536 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 09:40:51,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 09:40:51,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 09:40:51,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:51,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 09:40:51,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:51,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2025-02-06 09:40:51,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:51,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 09:40:51,761 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-02-06 09:40:51,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 29 [2025-02-06 09:40:51,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 09:40:51,906 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 24 treesize of output 12 [2025-02-06 09:40:51,913 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 09:40:51,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:40:51,958 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 09:40:51,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958589210] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:40:51,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:40:51,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 09:40:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907796783] [2025-02-06 09:40:51,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:40:51,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:40:51,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:51,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:40:51,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:40:51,959 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:52,069 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2025-02-06 09:40:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:40:52,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 09:40:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:52,070 INFO L225 Difference]: With dead ends: 67 [2025-02-06 09:40:52,070 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 09:40:52,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:40:52,071 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:52,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 171 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:40:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 09:40:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2025-02-06 09:40:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 54 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-02-06 09:40:52,074 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 13 [2025-02-06 09:40:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:52,074 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-02-06 09:40:52,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-02-06 09:40:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 09:40:52,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:52,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:52,082 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 09:40:52,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:52,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:52,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1510207976, now seen corresponding path program 1 times [2025-02-06 09:40:52,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:52,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315754243] [2025-02-06 09:40:52,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:52,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:52,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:40:52,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:40:52,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:52,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:52,342 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 09:40:52,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:52,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315754243] [2025-02-06 09:40:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315754243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:40:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717565541] [2025-02-06 09:40:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:52,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:40:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:52,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:40:52,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:52,345 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:52,366 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-02-06 09:40:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:40:52,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 09:40:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:52,367 INFO L225 Difference]: With dead ends: 55 [2025-02-06 09:40:52,367 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 09:40:52,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:52,367 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:52,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 09:40:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 09:40:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 53 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-02-06 09:40:52,371 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 14 [2025-02-06 09:40:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:52,371 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-02-06 09:40:52,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-02-06 09:40:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 09:40:52,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:52,372 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:52,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:40:52,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:52,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:52,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1679471421, now seen corresponding path program 1 times [2025-02-06 09:40:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:52,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980439665] [2025-02-06 09:40:52,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:52,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:52,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 09:40:52,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 09:40:52,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:52,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:53,110 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 09:40:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:53,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980439665] [2025-02-06 09:40:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980439665] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304602792] [2025-02-06 09:40:53,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:53,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:53,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:53,114 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 09:40:53,115 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 09:40:53,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 09:40:53,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 09:40:53,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:53,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:53,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 09:40:53,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:53,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 32 treesize of output 36 [2025-02-06 09:40:53,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:53,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:53,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:53,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2025-02-06 09:40:53,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 28 treesize of output 32 [2025-02-06 09:40:53,384 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-02-06 09:40:53,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 63 [2025-02-06 09:40:53,401 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 09:40:53,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2025-02-06 09:40:53,410 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 15 treesize of output 7 [2025-02-06 09:40:53,428 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 23 treesize of output 11 [2025-02-06 09:40:53,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2025-02-06 09:40:53,675 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-02-06 09:40:53,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 46 [2025-02-06 09:40:53,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2025-02-06 09:40:53,986 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 09:40:53,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:40:54,151 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 09:40:54,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304602792] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:40:54,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:40:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-02-06 09:40:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864211935] [2025-02-06 09:40:54,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:40:54,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 09:40:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:54,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 09:40:54,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-06 09:40:54,153 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:54,777 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-02-06 09:40:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:40:54,778 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 09:40:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:54,778 INFO L225 Difference]: With dead ends: 72 [2025-02-06 09:40:54,779 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 09:40:54,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-02-06 09:40:54,779 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 64 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:54,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 340 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 09:40:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 09:40:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2025-02-06 09:40:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 55 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-02-06 09:40:54,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 18 [2025-02-06 09:40:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:54,783 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-02-06 09:40:54,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-02-06 09:40:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 09:40:54,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:54,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:54,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 09:40:54,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:54,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:54,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1144201526, now seen corresponding path program 2 times [2025-02-06 09:40:54,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:54,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12448174] [2025-02-06 09:40:54,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:40:54,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:55,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 09:40:55,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:40:55,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:40:55,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:55,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12448174] [2025-02-06 09:40:55,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12448174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561674261] [2025-02-06 09:40:55,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:40:55,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:55,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:55,410 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 09:40:55,417 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 09:40:55,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 09:40:55,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:40:55,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:40:55,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:55,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 09:40:55,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:55,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 32 treesize of output 36 [2025-02-06 09:40:55,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 32 treesize of output 36 [2025-02-06 09:40:55,664 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-02-06 09:40:55,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 79 [2025-02-06 09:40:55,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 09:40:55,684 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 19 treesize of output 31 [2025-02-06 09:40:55,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:55,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:55,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:55,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-02-06 09:40:55,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:55,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:55,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2025-02-06 09:40:55,705 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 15 treesize of output 23 [2025-02-06 09:40:55,714 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 31 treesize of output 15 [2025-02-06 09:40:55,854 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2025-02-06 09:40:55,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 118 treesize of output 80 [2025-02-06 09:40:55,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:55,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:55,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2025-02-06 09:40:56,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:56,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:56,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2025-02-06 09:40:56,093 INFO L349 Elim1Store]: treesize reduction 80, result has 8.0 percent of original size [2025-02-06 09:40:56,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 88 treesize of output 55 [2025-02-06 09:40:56,180 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-02-06 09:40:56,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 36 [2025-02-06 09:40:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:56,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:40:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:56,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561674261] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:40:56,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:40:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-06 09:40:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128564863] [2025-02-06 09:40:56,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:40:56,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 09:40:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:56,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 09:40:56,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-06 09:40:56,323 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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 09:40:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:56,549 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-02-06 09:40:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:40:56,550 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 09:40:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:56,550 INFO L225 Difference]: With dead ends: 72 [2025-02-06 09:40:56,550 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 09:40:56,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-02-06 09:40:56,551 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:56,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 241 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:40:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 09:40:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2025-02-06 09:40:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 59 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2025-02-06 09:40:56,556 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 19 [2025-02-06 09:40:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:56,557 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2025-02-06 09:40:56,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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 09:40:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2025-02-06 09:40:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 09:40:56,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:56,557 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] [2025-02-06 09:40:56,565 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 09:40:56,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:56,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:56,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash 394641670, now seen corresponding path program 1 times [2025-02-06 09:40:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027954424] [2025-02-06 09:40:56,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:56,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 09:40:56,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 09:40:56,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:56,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:56,924 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 09:40:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:56,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027954424] [2025-02-06 09:40:56,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027954424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:56,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470618705] [2025-02-06 09:40:56,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:56,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:56,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:56,927 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 09:40:56,928 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 09:40:56,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 09:40:57,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 09:40:57,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:57,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:57,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 09:40:57,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:57,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2025-02-06 09:40:57,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:57,047 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-02-06 09:40:57,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2025-02-06 09:40:57,060 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-02-06 09:40:57,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 36 [2025-02-06 09:40:57,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:57,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-06 09:40:57,120 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-06 09:40:57,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-06 09:40:57,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-02-06 09:40:57,198 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 24 treesize of output 12 [2025-02-06 09:40:57,202 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 09:40:57,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:40:57,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2025-02-06 09:40:57,267 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 09:40:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470618705] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:40:57,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:40:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2025-02-06 09:40:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626031528] [2025-02-06 09:40:57,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:40:57,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:40:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:57,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:40:57,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=1, NotChecked=20, Total=156 [2025-02-06 09:40:57,268 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:57,901 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2025-02-06 09:40:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:40:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 09:40:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:57,902 INFO L225 Difference]: With dead ends: 120 [2025-02-06 09:40:57,902 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 09:40:57,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=187, Unknown=1, NotChecked=30, Total=306 [2025-02-06 09:40:57,903 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 155 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:57,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 250 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2025-02-06 09:40:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 09:40:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 86. [2025-02-06 09:40:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 84 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2025-02-06 09:40:57,913 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 21 [2025-02-06 09:40:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:57,913 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2025-02-06 09:40:57,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2025-02-06 09:40:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 09:40:57,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:57,914 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:57,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 09:40:58,114 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,SelfDestructingSolverStorable7 [2025-02-06 09:40:58,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:58,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash -94256441, now seen corresponding path program 2 times [2025-02-06 09:40:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:58,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485614212] [2025-02-06 09:40:58,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:40:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:58,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 09:40:58,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 09:40:58,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:40:58,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:58,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485614212] [2025-02-06 09:40:58,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485614212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:58,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490294870] [2025-02-06 09:40:58,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:40:58,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:58,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:58,405 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 09:40:58,406 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 09:40:58,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 09:40:58,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 09:40:58,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:40:58,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:58,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 09:40:58,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:58,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2025-02-06 09:40:58,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:40:58,714 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-02-06 09:40:58,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2025-02-06 09:40:58,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-02-06 09:40:58,790 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 09:40:58,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 09:40:58,812 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-02-06 09:40:58,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 25 [2025-02-06 09:40:58,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 09:40:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:40:58,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:58,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490294870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:58,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:40:58,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-02-06 09:40:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637412019] [2025-02-06 09:40:58,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:58,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:40:58,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:58,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:40:58,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:40:58,928 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:59,179 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2025-02-06 09:40:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:40:59,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 09:40:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:59,183 INFO L225 Difference]: With dead ends: 137 [2025-02-06 09:40:59,183 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 09:40:59,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-06 09:40:59,184 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 98 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:59,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 171 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:40:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 09:40:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 103. [2025-02-06 09:40:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 101 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2025-02-06 09:40:59,188 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 23 [2025-02-06 09:40:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:59,188 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2025-02-06 09:40:59,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2025-02-06 09:40:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 09:40:59,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:59,189 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:59,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 09:40:59,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:59,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:59,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:59,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1948002047, now seen corresponding path program 2 times [2025-02-06 09:40:59,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:59,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203405094] [2025-02-06 09:40:59,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:40:59,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:59,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 09:40:59,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:40:59,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:40:59,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:59,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:59,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203405094] [2025-02-06 09:40:59,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203405094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:59,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381661683] [2025-02-06 09:40:59,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:40:59,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:59,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:59,921 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 09:40:59,922 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 09:41:00,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 09:41:00,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:41:00,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:41:00,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:00,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-06 09:41:00,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:41:00,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 32 treesize of output 36 [2025-02-06 09:41:00,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 36 treesize of output 40 [2025-02-06 09:41:00,349 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-02-06 09:41:00,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 84 [2025-02-06 09:41:00,386 INFO L349 Elim1Store]: treesize reduction 94, result has 34.3 percent of original size [2025-02-06 09:41:00,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 78 [2025-02-06 09:41:00,403 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 23 treesize of output 11 [2025-02-06 09:41:00,411 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 19 treesize of output 31 [2025-02-06 09:41:00,426 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 31 treesize of output 15 [2025-02-06 09:41:00,443 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-06 09:41:00,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2025-02-06 09:41:00,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 09:41:00,639 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2025-02-06 09:41:00,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 118 treesize of output 73 [2025-02-06 09:41:00,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:00,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 71 [2025-02-06 09:41:00,906 INFO L349 Elim1Store]: treesize reduction 64, result has 9.9 percent of original size [2025-02-06 09:41:00,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 66 [2025-02-06 09:41:00,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:00,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2025-02-06 09:41:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:01,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:41:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381661683] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:41:10,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:41:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-06 09:41:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960514243] [2025-02-06 09:41:10,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:41:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 09:41:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:10,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 09:41:10,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=384, Unknown=2, NotChecked=0, Total=462 [2025-02-06 09:41:10,589 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:11,655 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2025-02-06 09:41:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:41:11,655 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 09:41:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:11,656 INFO L225 Difference]: With dead ends: 125 [2025-02-06 09:41:11,656 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 09:41:11,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=145, Invalid=665, Unknown=2, NotChecked=0, Total=812 [2025-02-06 09:41:11,657 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 73 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:11,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 404 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 09:41:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 09:41:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2025-02-06 09:41:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 107 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2025-02-06 09:41:11,662 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 24 [2025-02-06 09:41:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2025-02-06 09:41:11,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2025-02-06 09:41:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 09:41:11,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:11,667 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:11,678 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 09:41:11,868 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,SelfDestructingSolverStorable9 [2025-02-06 09:41:11,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:11,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:11,869 INFO L85 PathProgramCache]: Analyzing trace with hash 39769979, now seen corresponding path program 1 times [2025-02-06 09:41:11,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:11,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409803375] [2025-02-06 09:41:11,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:11,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:11,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 09:41:11,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:41:11,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:11,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409803375] [2025-02-06 09:41:12,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409803375] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:41:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067255608] [2025-02-06 09:41:12,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:12,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:12,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:41:12,252 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 09:41:12,253 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 09:41:12,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 09:41:12,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:41:12,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:12,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:12,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 09:41:12,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:41:12,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 24 treesize of output 28 [2025-02-06 09:41:12,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2025-02-06 09:41:12,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:12,425 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-02-06 09:41:12,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2025-02-06 09:41:12,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2025-02-06 09:41:12,446 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-02-06 09:41:12,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 61 [2025-02-06 09:41:12,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-02-06 09:41:12,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 09:41:12,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:12,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2025-02-06 09:41:12,543 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2025-02-06 09:41:12,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 29 [2025-02-06 09:41:12,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 09:41:12,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 09:41:12,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 09:41:12,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-02-06 09:41:12,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-02-06 09:41:12,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-02-06 09:41:12,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 09:41:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:12,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:41:12,918 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1)) is different from false [2025-02-06 09:41:12,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:41:12,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-02-06 09:41:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:13,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067255608] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:41:13,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:41:13,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-06 09:41:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482172759] [2025-02-06 09:41:13,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:41:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 09:41:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:13,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 09:41:13,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=301, Unknown=1, NotChecked=34, Total=380 [2025-02-06 09:41:13,012 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:15,148 INFO L93 Difference]: Finished difference Result 301 states and 365 transitions. [2025-02-06 09:41:15,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 09:41:15,148 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 09:41:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:15,149 INFO L225 Difference]: With dead ends: 301 [2025-02-06 09:41:15,149 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 09:41:15,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=398, Invalid=1411, Unknown=1, NotChecked=82, Total=1892 [2025-02-06 09:41:15,150 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 555 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 39 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:15,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 560 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 661 Invalid, 3 Unknown, 193 Unchecked, 0.8s Time] [2025-02-06 09:41:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 09:41:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 195. [2025-02-06 09:41:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.2146596858638743) internal successors, (232), 193 states have internal predecessors, (232), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 234 transitions. [2025-02-06 09:41:15,159 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 234 transitions. Word has length 24 [2025-02-06 09:41:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:15,159 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 234 transitions. [2025-02-06 09:41:15,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 234 transitions. [2025-02-06 09:41:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 09:41:15,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:15,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:15,169 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 09:41:15,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:15,361 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:15,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:15,362 INFO L85 PathProgramCache]: Analyzing trace with hash 361673714, now seen corresponding path program 3 times [2025-02-06 09:41:15,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:15,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202153215] [2025-02-06 09:41:15,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:41:15,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:15,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-02-06 09:41:15,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:41:15,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 09:41:15,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202153215] [2025-02-06 09:41:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202153215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:41:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581014245] [2025-02-06 09:41:15,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:41:15,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:15,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:41:15,957 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 09:41:15,961 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 09:41:16,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-02-06 09:41:16,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:41:16,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 09:41:16,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:16,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 09:41:16,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:41:16,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2025-02-06 09:41:16,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2025-02-06 09:41:16,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 48 treesize of output 52 [2025-02-06 09:41:16,871 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2025-02-06 09:41:16,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 159 [2025-02-06 09:41:16,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:16,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:16,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:16,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 11 [2025-02-06 09:41:16,892 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 09:41:17,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 09:41:17,009 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 09:41:17,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 60 [2025-02-06 09:41:17,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 09:41:17,147 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 09:41:17,151 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 09:41:17,154 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 09:41:17,160 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 09:41:17,162 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 09:41:17,234 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 09:41:17,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 86 [2025-02-06 09:41:17,335 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 09:41:17,335 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 78 [2025-02-06 09:41:17,469 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_76| Int) (v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_78| Int) (v_DerPreprocessor_5 Int) (v_arrayElimIndex_22 Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~bcki~0#1.base_76| 1))) (let ((.cse1 (select (let ((.cse2 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimIndex_22 v_DerPreprocessor_5) |v_ULTIMATE.start_main_~bcki~0#1.base_78| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~bcki~0#1.base_78| v_DerPreprocessor_7) |v_ULTIMATE.start_main_~bcki~0#1.base_76| 0) v_arrayElimIndex_22 0) |v_ULTIMATE.start_main_~bcki~0#1.base_78|)) |v_ULTIMATE.start_main_~bcki~0#1.base_76| 0))) (store (store .cse0 v_arrayElimIndex_22 (select .cse2 v_arrayElimIndex_22)) |v_ULTIMATE.start_main_~bcki~0#1.base_78| (select .cse2 |v_ULTIMATE.start_main_~bcki~0#1.base_78|))) v_arrayElimIndex_22))) (and (= (select (store .cse0 v_arrayElimIndex_22 .cse1) |v_ULTIMATE.start_main_~bcki~0#1.base_78|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~bcki~0#1.base_76| 0) v_arrayElimIndex_22 0) |v_ULTIMATE.start_main_~bcki~0#1.base_78| 0)) (<= 1 .cse1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimIndex_22) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~bcki~0#1.base_76|) 0))))) is different from true [2025-02-06 09:41:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-06 09:41:17,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:41:17,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 Int)) (= (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (store (store (store |c_#valid| |c_ULTIMATE.start_main_~bcki~0#1.base| 0) .cse0 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4) v_ArrVal_1417)) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|)) 0))) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-02-06 09:41:17,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 Int)) (= (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (store (store (store |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base| 0) .cse0 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4) v_ArrVal_1417)) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-02-06 09:41:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-06 09:41:17,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581014245] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:41:17,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:41:17,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-02-06 09:41:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506828887] [2025-02-06 09:41:17,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:41:17,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 09:41:17,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:17,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 09:41:17,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2025-02-06 09:41:17,561 INFO L87 Difference]: Start difference. First operand 195 states and 234 transitions. Second operand has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 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 09:41:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:18,282 INFO L93 Difference]: Finished difference Result 218 states and 261 transitions. [2025-02-06 09:41:18,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:41:18,283 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 09:41:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:18,284 INFO L225 Difference]: With dead ends: 218 [2025-02-06 09:41:18,284 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 09:41:18,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=284, Unknown=3, NotChecked=108, Total=462 [2025-02-06 09:41:18,284 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:18,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 527 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 413 Invalid, 0 Unknown, 228 Unchecked, 0.6s Time] [2025-02-06 09:41:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 09:41:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 195. [2025-02-06 09:41:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.2146596858638743) internal successors, (232), 193 states have internal predecessors, (232), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 234 transitions. [2025-02-06 09:41:18,288 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 234 transitions. Word has length 25 [2025-02-06 09:41:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:18,288 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 234 transitions. [2025-02-06 09:41:18,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 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 09:41:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 234 transitions. [2025-02-06 09:41:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 09:41:18,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:18,289 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:18,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 09:41:18,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:18,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:18,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1612184195, now seen corresponding path program 1 times [2025-02-06 09:41:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806926068] [2025-02-06 09:41:18,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:18,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 09:41:18,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 09:41:18,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:18,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806926068] [2025-02-06 09:41:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806926068] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:41:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809270644] [2025-02-06 09:41:18,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:18,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:41:18,971 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 09:41:18,972 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 09:41:19,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 09:41:19,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 09:41:19,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:19,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:19,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-06 09:41:19,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:41:19,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 28 treesize of output 32 [2025-02-06 09:41:19,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 32 treesize of output 36 [2025-02-06 09:41:19,180 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-02-06 09:41:19,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 78 [2025-02-06 09:41:19,185 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 31 treesize of output 1 [2025-02-06 09:41:19,209 INFO L349 Elim1Store]: treesize reduction 102, result has 32.5 percent of original size [2025-02-06 09:41:19,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 54 [2025-02-06 09:41:19,218 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 23 treesize of output 11 [2025-02-06 09:41:19,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2025-02-06 09:41:19,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2025-02-06 09:41:19,256 INFO L349 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2025-02-06 09:41:19,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 70 [2025-02-06 09:41:19,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:19,332 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-06 09:41:19,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 62 [2025-02-06 09:41:19,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:19,365 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-02-06 09:41:19,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 37 [2025-02-06 09:41:19,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:19,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-02-06 09:41:19,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-02-06 09:41:19,463 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-06 09:41:19,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 60 [2025-02-06 09:41:19,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:41:19,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-02-06 09:41:19,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-02-06 09:41:19,819 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:41:19,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 41 [2025-02-06 09:41:19,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 09:41:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:19,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:41:19,992 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1584)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1583))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) 2)) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))) 2)) is different from false [2025-02-06 09:41:20,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:41:20,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2025-02-06 09:41:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809270644] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:41:20,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:41:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-02-06 09:41:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207142243] [2025-02-06 09:41:20,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:41:20,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:41:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:20,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:41:20,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2025-02-06 09:41:20,077 INFO L87 Difference]: Start difference. First operand 195 states and 234 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:20,924 INFO L93 Difference]: Finished difference Result 352 states and 425 transitions. [2025-02-06 09:41:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:41:20,925 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 09:41:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:20,927 INFO L225 Difference]: With dead ends: 352 [2025-02-06 09:41:20,927 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 09:41:20,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=614, Unknown=1, NotChecked=52, Total=812 [2025-02-06 09:41:20,928 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 157 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:20,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 454 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 504 Invalid, 0 Unknown, 91 Unchecked, 0.5s Time] [2025-02-06 09:41:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 09:41:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 261. [2025-02-06 09:41:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.2334630350194553) internal successors, (317), 259 states have internal predecessors, (317), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 319 transitions. [2025-02-06 09:41:20,936 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 319 transitions. Word has length 26 [2025-02-06 09:41:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 319 transitions. [2025-02-06 09:41:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:41:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 319 transitions. [2025-02-06 09:41:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 09:41:20,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:20,938 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, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:20,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 09:41:21,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:21,138 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:21,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1334802023, now seen corresponding path program 1 times [2025-02-06 09:41:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674618789] [2025-02-06 09:41:21,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:21,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:41:21,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:41:21,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:21,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:41:21,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:41:21,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:41:21,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:41:21,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:21,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:41:21,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:41:21,247 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:41:21,248 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-06 09:41:21,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-06 09:41:21,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:41:21,256 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:21,299 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:41:21,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:41:21 BoogieIcfgContainer [2025-02-06 09:41:21,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:41:21,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:41:21,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:41:21,307 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:41:21,308 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:49" (3/4) ... [2025-02-06 09:41:21,308 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 09:41:21,374 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 24. [2025-02-06 09:41:21,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:41:21,480 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:41:21,480 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:41:21,480 INFO L158 Benchmark]: Toolchain (without parser) took 32608.37ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 121.6MB in the beginning and 505.0MB in the end (delta: -383.3MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2025-02-06 09:41:21,480 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:41:21,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.09ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 104.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:41:21,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.25ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:41:21,481 INFO L158 Benchmark]: Boogie Preprocessor took 55.67ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:41:21,481 INFO L158 Benchmark]: IcfgBuilder took 423.10ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 80.9MB in the end (delta: 19.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:41:21,481 INFO L158 Benchmark]: TraceAbstraction took 31541.22ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 80.3MB in the beginning and 513.3MB in the end (delta: -433.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2025-02-06 09:41:21,481 INFO L158 Benchmark]: Witness Printer took 172.82ms. Allocated memory is still 604.0MB. Free memory was 513.3MB in the beginning and 505.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:41:21,487 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.09ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 104.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.25ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.67ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 423.10ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 80.9MB in the end (delta: 19.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 31541.22ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 80.3MB in the beginning and 513.3MB in the end (delta: -433.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Witness Printer took 172.82ms. Allocated memory is still 604.0MB. Free memory was 513.3MB in the beginning and 505.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1004] BCK* bucket = malloc(sizeof(BCK)); [L1005] bucket->data = 0 [L1006] bucket->list = ((void*)0) [L1008] bucket->next = malloc(sizeof(BCK)) [L1009] EXPR bucket->next [L1009] BCK* bcki = bucket->next; [L1010] bcki->data = 1 [L1011] bcki->list = ((void*)0) [L1013] bcki->next = malloc(sizeof(BCK)) [L1014] EXPR bcki->next [L1014] bcki = bcki->next [L1015] bcki->data = 2 [L1016] bcki->list = ((void*)0) [L1017] bcki->next = ((void*)0) [L1019] struct TSLL* item = ((void*)0); [L1020] struct TSLL* itr = ((void*)0); VAL [bucket={-3:0}] [L1021] COND TRUE __VERIFIER_nondet_int() [L1021] COND TRUE __VERIFIER_nondet_int() [L1023] item = malloc(sizeof(SLL)) [L1024] item->next = ((void*)0) [L1025] COND TRUE __VERIFIER_nondet_int() [L1026] item->data = 0 [L1032] bcki = bucket VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND TRUE 0 VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND TRUE 0 VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND FALSE !(!(item != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1036] COND TRUE bcki->data != item->data [L1036] EXPR bcki->data [L1036] EXPR item->data [L1036] COND FALSE !(bcki->data != item->data) [L1038] COND TRUE 0 VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1038] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1038] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1040] EXPR bcki->list [L1040] COND TRUE bcki->list == ((void*)0) [L1041] bcki->list = item [L1021] COND TRUE __VERIFIER_nondet_int() [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1052] bcki = bucket VAL [bcki={-3:0}] [L1053] COND TRUE bcki != ((void*)0) [L1055] EXPR bcki->list [L1055] item = bcki->list [L1056] bcki->list = ((void*)0) [L1057] COND TRUE item != ((void*)0) [L1059] itr = item [L1060] EXPR item->next [L1060] item = item->next [L1061] COND TRUE 0 [L1061] EXPR itr->data [L1061] EXPR bcki->data [L1061] COND TRUE !(itr->data != bcki->data) [L1061] CALL reach_error() [L985] COND FALSE !(0) [L985] __assert_fail ("0", "sll-buckets-2.c", 14, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 1001]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1255 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1255 mSDsluCounter, 3450 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 605 IncrementalHoareTripleChecker+Unchecked, 2865 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2873 IncrementalHoareTripleChecker+Invalid, 3605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 585 mSDtfsCounter, 2873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 296 SyntacticMatches, 5 SemanticMatches, 197 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=13, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 356 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 565 ConstructedInterpolants, 76 QuantifiedInterpolants, 18310 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2140 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 32/198 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 09:41:21,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)