./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 48c9605d 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-?-48c9605-m [2025-02-08 05:48:53,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:48:53,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:48:53,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:48:53,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:48:53,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:48:53,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:48:53,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:48:53,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:48:53,477 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:48:53,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:48:53,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:48:53,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:48:53,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:48:53,478 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:48:53,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:48:53,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:48:53,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:48:53,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:48:53,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:48:53,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:48:53,480 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-08 05:48:53,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:48:53,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:48:53,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:48:53,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:48:53,721 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:48:53,722 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-08 05:48:54,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e41fc33b/93e03ab45389471d86d4aae3f6de6032/FLAG289fead07 [2025-02-08 05:48:55,202 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:48:55,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2025-02-08 05:48:55,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e41fc33b/93e03ab45389471d86d4aae3f6de6032/FLAG289fead07 [2025-02-08 05:48:55,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e41fc33b/93e03ab45389471d86d4aae3f6de6032 [2025-02-08 05:48:55,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:48:55,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:48:55,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:48:55,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:48:55,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:48:55,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e24748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55, skipping insertion in model container [2025-02-08 05:48:55,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:48:55,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:48:55,774 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:48:55,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:48:55,847 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:48:55,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55 WrapperNode [2025-02-08 05:48:55,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:48:55,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:48:55,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:48:55,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:48:55,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,881 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2025-02-08 05:48:55,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:48:55,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:48:55,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:48:55,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:48:55,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,914 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-08 05:48:55,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:48:55,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:48:55,929 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:48:55,929 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:48:55,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (1/1) ... [2025-02-08 05:48:55,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:48:55,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:48:55,951 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-08 05:48:55,953 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-08 05:48:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 05:48:55,970 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:48:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:48:55,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:48:55,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:48:55,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:48:55,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:48:55,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:48:55,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:48:56,048 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:48:56,049 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:48:56,284 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-08 05:48:56,284 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:48:56,291 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:48:56,291 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:48:56,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:56 BoogieIcfgContainer [2025-02-08 05:48:56,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:48:56,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:48:56,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:48:56,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:48:56,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:48:55" (1/3) ... [2025-02-08 05:48:56,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fc4474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:48:56, skipping insertion in model container [2025-02-08 05:48:56,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:55" (2/3) ... [2025-02-08 05:48:56,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fc4474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:48:56, skipping insertion in model container [2025-02-08 05:48:56,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:56" (3/3) ... [2025-02-08 05:48:56,299 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2025-02-08 05:48:56,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:48:56,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-buckets-2.i that has 2 procedures, 52 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-02-08 05:48:56,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:48:56,348 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;@2bff3310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:48:56,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:48:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 45 states have internal predecessors, (72), 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-08 05:48:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 05:48:56,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:56,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 05:48:56,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:56,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 105845724, now seen corresponding path program 1 times [2025-02-08 05:48:56,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:56,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201171460] [2025-02-08 05:48:56,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:56,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 05:48:56,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 05:48:56,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:56,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:56,522 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-08 05:48:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201171460] [2025-02-08 05:48:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201171460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:56,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:56,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:48:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907059971] [2025-02-08 05:48:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:56,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:48:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:56,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:48:56,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:48:56,543 INFO L87 Difference]: Start difference. First operand has 52 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 45 states have internal predecessors, (72), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:56,552 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2025-02-08 05:48:56,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:48:56,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 05:48:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:56,557 INFO L225 Difference]: With dead ends: 45 [2025-02-08 05:48:56,557 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 05:48:56,558 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-08 05:48:56,560 INFO L435 NwaCegarLoop]: 56 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, 56 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-08 05:48:56,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:48:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 05:48:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 05:48:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 41 states have internal predecessors, (49), 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-08 05:48:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-02-08 05:48:56,599 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 5 [2025-02-08 05:48:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:56,599 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-02-08 05:48:56,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-02-08 05:48:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 05:48:56,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:56,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 05:48:56,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:48:56,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:56,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1013222226, now seen corresponding path program 1 times [2025-02-08 05:48:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584831756] [2025-02-08 05:48:56,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:56,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 05:48:56,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 05:48:56,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:56,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:56,716 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-08 05:48:56,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584831756] [2025-02-08 05:48:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584831756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:56,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:48:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007024230] [2025-02-08 05:48:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:56,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:48:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:56,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:48:56,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:48:56,718 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:56,767 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-02-08 05:48:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:48:56,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 05:48:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:56,768 INFO L225 Difference]: With dead ends: 61 [2025-02-08 05:48:56,769 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 05:48:56,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:48:56,769 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 61 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 90 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:48:56,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 90 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:48:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 05:48:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2025-02-08 05:48:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 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-08 05:48:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-02-08 05:48:56,773 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 6 [2025-02-08 05:48:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:56,773 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-02-08 05:48:56,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-02-08 05:48:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 05:48:56,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:56,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:56,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:48:56,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:56,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash -625376120, now seen corresponding path program 1 times [2025-02-08 05:48:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:56,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595892946] [2025-02-08 05:48:56,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:56,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 05:48:56,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 05:48:56,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:57,270 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-08 05:48:57,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:57,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595892946] [2025-02-08 05:48:57,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595892946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:57,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:57,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:48:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941514566] [2025-02-08 05:48:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:57,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:48:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:57,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:48:57,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:48:57,271 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-08 05:48:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:57,399 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-02-08 05:48:57,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:48:57,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2025-02-08 05:48:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:57,400 INFO L225 Difference]: With dead ends: 53 [2025-02-08 05:48:57,400 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 05:48:57,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:48:57,400 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 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-08 05:48:57,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:48:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 05:48:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-02-08 05:48:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 49 states have internal predecessors, (59), 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-08 05:48:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-02-08 05:48:57,407 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 11 [2025-02-08 05:48:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:57,407 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-02-08 05:48:57,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-08 05:48:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-02-08 05:48:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 05:48:57,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:57,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:57,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:48:57,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:57,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1586566710, now seen corresponding path program 1 times [2025-02-08 05:48:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:57,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420666882] [2025-02-08 05:48:57,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:57,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:57,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 05:48:57,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 05:48:57,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:57,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:57,745 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-08 05:48:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:57,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420666882] [2025-02-08 05:48:57,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420666882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:48:57,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471790771] [2025-02-08 05:48:57,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:57,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:48:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:48:57,751 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-08 05:48:57,753 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-08 05:48:57,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 05:48:57,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 05:48:57,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:57,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:57,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 05:48:57,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:48:57,899 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-08 05:48:57,923 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2025-02-08 05:48:57,923 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 65 treesize of output 46 [2025-02-08 05:48:57,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:48:57,935 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-08 05:48:58,001 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-08 05:48:58,056 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-08 05:48:58,060 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-08 05:48:58,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:48:58,084 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-08 05:48:58,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471790771] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:48:58,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:48:58,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 05:48:58,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354862881] [2025-02-08 05:48:58,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:48:58,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:48:58,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:58,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:48:58,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:48:58,087 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:58,194 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2025-02-08 05:48:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:48:58,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 05:48:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:58,196 INFO L225 Difference]: With dead ends: 66 [2025-02-08 05:48:58,196 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 05:48:58,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 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-08 05:48:58,196 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:48:58,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 171 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:48:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 05:48:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2025-02-08 05:48:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.26) internal successors, (63), 53 states have internal predecessors, (63), 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-08 05:48:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-02-08 05:48:58,200 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 12 [2025-02-08 05:48:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:58,200 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-02-08 05:48:58,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-02-08 05:48:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 05:48:58,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:58,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:58,212 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-08 05:48:58,406 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-08 05:48:58,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:58,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1088683015, now seen corresponding path program 1 times [2025-02-08 05:48:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:58,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958685216] [2025-02-08 05:48:58,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:58,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 05:48:58,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 05:48:58,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:58,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:58,508 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-08 05:48:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:58,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958685216] [2025-02-08 05:48:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958685216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:58,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:58,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:48:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355099511] [2025-02-08 05:48:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:58,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:48:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:58,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:48:58,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:48:58,514 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 05:48:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:58,545 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2025-02-08 05:48:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:48:58,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2025-02-08 05:48:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:58,546 INFO L225 Difference]: With dead ends: 54 [2025-02-08 05:48:58,546 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 05:48:58,546 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-08 05:48:58,547 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 59 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-08 05:48:58,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 59 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:48:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 05:48:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 05:48:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.24) internal successors, (62), 52 states have internal predecessors, (62), 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-08 05:48:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-08 05:48:58,550 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 13 [2025-02-08 05:48:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:58,550 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-08 05:48:58,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 05:48:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-08 05:48:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 05:48:58,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:58,551 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:58,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:48:58,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:58,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:58,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2140070124, now seen corresponding path program 1 times [2025-02-08 05:48:58,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:58,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218225417] [2025-02-08 05:48:58,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:58,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:58,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:48:58,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:48:58,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:58,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:59,510 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-08 05:48:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:59,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218225417] [2025-02-08 05:48:59,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218225417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:48:59,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140882863] [2025-02-08 05:48:59,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:59,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:48:59,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:48:59,513 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-08 05:48:59,516 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-08 05:48:59,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:48:59,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:48:59,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:59,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:59,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 05:48:59,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:48:59,634 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-08 05:48:59,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:48:59,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:48:59,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:48:59,643 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-08 05:48:59,654 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-08 05:48:59,678 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-02-08 05:48:59,678 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 75 treesize of output 74 [2025-02-08 05:48:59,688 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-08 05:48:59,700 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-08 05:48:59,714 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-08 05:48:59,714 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 234 treesize of output 208 [2025-02-08 05:48:59,767 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-08 05:48:59,777 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-08 05:49:00,007 INFO L349 Elim1Store]: treesize reduction 88, result has 14.6 percent of original size [2025-02-08 05:49:00,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 129 treesize of output 83 [2025-02-08 05:49:00,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:00,028 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 63 treesize of output 67 [2025-02-08 05:49:00,301 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-08 05:49:00,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:00,508 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-08 05:49:00,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140882863] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:00,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:00,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-02-08 05:49:00,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784760238] [2025-02-08 05:49:00,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:00,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 05:49:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:00,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 05:49:00,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-08 05:49:00,509 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-08 05:49:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:01,423 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2025-02-08 05:49:01,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:49:01,426 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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 17 [2025-02-08 05:49:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:01,426 INFO L225 Difference]: With dead ends: 78 [2025-02-08 05:49:01,426 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 05:49:01,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-02-08 05:49:01,427 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 81 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:01,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 310 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 05:49:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 05:49:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-02-08 05:49:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 70 states have internal predecessors, (84), 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-08 05:49:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2025-02-08 05:49:01,437 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 17 [2025-02-08 05:49:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:01,437 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2025-02-08 05:49:01,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-08 05:49:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2025-02-08 05:49:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 05:49:01,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:01,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:01,455 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-08 05:49:01,638 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-08 05:49:01,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1757079066, now seen corresponding path program 2 times [2025-02-08 05:49:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972767646] [2025-02-08 05:49:01,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:01,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 05:49:01,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 05:49:01,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:01,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:02,080 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-08 05:49:02,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972767646] [2025-02-08 05:49:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972767646] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792780229] [2025-02-08 05:49:02,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:02,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:02,083 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-08 05:49:02,091 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-08 05:49:02,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 05:49:02,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 05:49:02,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:02,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:02,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 05:49:02,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:02,249 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-08 05:49:02,255 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2025-02-08 05:49:02,271 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2025-02-08 05:49:02,271 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 162 treesize of output 135 [2025-02-08 05:49:02,277 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-08 05:49:02,280 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 44 treesize of output 48 [2025-02-08 05:49:02,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:02,292 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2025-02-08 05:49:02,293 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 1 case distinctions, treesize of input 48 treesize of output 47 [2025-02-08 05:49:02,296 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-08 05:49:02,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:02,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:02,322 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-08 05:49:02,504 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 05:49:02,504 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 93 treesize of output 47 [2025-02-08 05:49:02,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2025-02-08 05:49:02,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2025-02-08 05:49:02,706 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 05:49:02,706 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 63 treesize of output 33 [2025-02-08 05:49:02,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:49:02,788 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 52 treesize of output 23 [2025-02-08 05:49:02,795 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-08 05:49:02,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:02,861 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-08 05:49:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792780229] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:02,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-02-08 05:49:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024202913] [2025-02-08 05:49:02,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:49:02,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:02,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:49:02,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:49:02,862 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:03,097 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2025-02-08 05:49:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:49:03,097 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 05:49:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:03,098 INFO L225 Difference]: With dead ends: 73 [2025-02-08 05:49:03,098 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 05:49:03,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-02-08 05:49:03,098 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:03,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 248 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:49:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 05:49:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-02-08 05:49:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 states have internal predecessors, (83), 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-08 05:49:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2025-02-08 05:49:03,101 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 18 [2025-02-08 05:49:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:03,102 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2025-02-08 05:49:03,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2025-02-08 05:49:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 05:49:03,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:03,102 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:03,109 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-08 05:49:03,307 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-08 05:49:03,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:03,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash -302234060, now seen corresponding path program 1 times [2025-02-08 05:49:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:03,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134071991] [2025-02-08 05:49:03,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:03,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:03,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:49:03,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:49:03,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:03,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:03,638 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-08 05:49:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134071991] [2025-02-08 05:49:03,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134071991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899352159] [2025-02-08 05:49:03,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:03,640 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-08 05:49:03,648 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-08 05:49:03,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:49:03,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:49:03,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:03,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:03,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 05:49:03,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:03,772 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-08 05:49:03,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:03,791 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-02-08 05:49:03,791 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-08 05:49:03,795 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-08 05:49:03,857 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-02-08 05:49:03,857 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-08 05:49:03,865 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-08 05:49:03,881 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-08 05:49:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:03,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:49:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899352159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:03,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:49:03,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2025-02-08 05:49:03,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974492002] [2025-02-08 05:49:03,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:03,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:49:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:03,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:49:03,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:49:03,972 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-08 05:49:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:04,203 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2025-02-08 05:49:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:49:04,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 20 [2025-02-08 05:49:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:04,204 INFO L225 Difference]: With dead ends: 116 [2025-02-08 05:49:04,204 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 05:49:04,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:49:04,204 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 98 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:04,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 167 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 05:49:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2025-02-08 05:49:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 87 states have internal predecessors, (103), 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-08 05:49:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2025-02-08 05:49:04,208 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 20 [2025-02-08 05:49:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:04,208 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2025-02-08 05:49:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-08 05:49:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2025-02-08 05:49:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 05:49:04,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:04,209 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-08 05:49:04,217 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-08 05:49:04,409 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-08 05:49:04,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:04,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 96665641, now seen corresponding path program 1 times [2025-02-08 05:49:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:04,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130712907] [2025-02-08 05:49:04,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:04,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:49:04,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:49:04,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:04,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:04,600 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-08 05:49:04,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130712907] [2025-02-08 05:49:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130712907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492278057] [2025-02-08 05:49:04,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:04,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:04,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:04,602 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-08 05:49:04,604 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-08 05:49:04,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:49:04,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:49:04,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:04,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:04,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 05:49:04,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:04,728 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 19 treesize of output 23 [2025-02-08 05:49:04,740 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 05:49:04,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2025-02-08 05:49:04,752 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 05:49:04,753 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 1 case distinctions, treesize of input 49 treesize of output 44 [2025-02-08 05:49:04,764 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-08 05:49:04,781 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2025-02-08 05:49:04,781 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 100 treesize of output 73 [2025-02-08 05:49:04,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:04,802 INFO L349 Elim1Store]: treesize reduction 45, result has 10.0 percent of original size [2025-02-08 05:49:04,802 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 49 treesize of output 29 [2025-02-08 05:49:04,887 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 05:49:04,888 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 86 treesize of output 69 [2025-02-08 05:49:04,918 INFO L349 Elim1Store]: treesize reduction 16, result has 73.8 percent of original size [2025-02-08 05:49:04,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 113 [2025-02-08 05:49:05,033 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 23 [2025-02-08 05:49:05,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:05,103 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 1 case distinctions, treesize of input 31 treesize of output 15 [2025-02-08 05:49:05,108 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-08 05:49:05,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:05,169 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-08 05:49:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492278057] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:05,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-02-08 05:49:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80739361] [2025-02-08 05:49:05,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:05,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:49:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:05,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:49:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=114, Unknown=5, NotChecked=0, Total=156 [2025-02-08 05:49:05,170 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 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-08 05:49:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:05,612 INFO L93 Difference]: Finished difference Result 213 states and 258 transitions. [2025-02-08 05:49:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 05:49:05,612 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 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 21 [2025-02-08 05:49:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:05,613 INFO L225 Difference]: With dead ends: 213 [2025-02-08 05:49:05,613 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 05:49:05,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=287, Unknown=6, NotChecked=0, Total=420 [2025-02-08 05:49:05,614 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 276 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:05,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 341 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:49:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 05:49:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2025-02-08 05:49:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 144 states have internal predecessors, (173), 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-08 05:49:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2025-02-08 05:49:05,620 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 21 [2025-02-08 05:49:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:05,621 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2025-02-08 05:49:05,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 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-08 05:49:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2025-02-08 05:49:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 05:49:05,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:05,621 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:05,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 05:49:05,826 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-08 05:49:05,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:05,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash -673291696, now seen corresponding path program 2 times [2025-02-08 05:49:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:05,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233189755] [2025-02-08 05:49:05,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:05,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 05:49:05,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:49:05,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:05,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:06,308 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-08 05:49:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233189755] [2025-02-08 05:49:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233189755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800253812] [2025-02-08 05:49:06,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:06,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:06,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:06,312 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-08 05:49:06,313 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-08 05:49:06,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 05:49:06,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:49:06,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:06,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:06,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 05:49:06,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:06,648 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-08 05:49:06,653 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-08 05:49:06,678 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-02-08 05:49:06,678 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 78 treesize of output 79 [2025-02-08 05:49:06,704 INFO L349 Elim1Store]: treesize reduction 94, result has 34.3 percent of original size [2025-02-08 05:49:06,705 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-08 05:49:06,720 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-08 05:49:06,731 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-08 05:49:06,742 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-08 05:49:06,757 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-08 05:49:06,757 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-08 05:49:06,769 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-08 05:49:06,943 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2025-02-08 05:49:06,944 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 122 treesize of output 80 [2025-02-08 05:49:06,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:06,960 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 63 treesize of output 67 [2025-02-08 05:49:07,133 INFO L349 Elim1Store]: treesize reduction 72, result has 8.9 percent of original size [2025-02-08 05:49:07,133 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 125 treesize of output 83 [2025-02-08 05:49:07,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:07,144 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 51 treesize of output 55 [2025-02-08 05:49:07,389 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-08 05:49:07,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:15,664 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-08 05:49:15,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800253812] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:15,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:15,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 19 [2025-02-08 05:49:15,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127986429] [2025-02-08 05:49:15,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:15,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:49:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:15,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:49:15,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=311, Unknown=1, NotChecked=0, Total=380 [2025-02-08 05:49:15,666 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 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-08 05:49:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:16,531 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. [2025-02-08 05:49:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:49:16,532 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 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-08 05:49:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:16,533 INFO L225 Difference]: With dead ends: 143 [2025-02-08 05:49:16,533 INFO L226 Difference]: Without dead ends: 143 [2025-02-08 05:49:16,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=122, Invalid=477, Unknown=1, NotChecked=0, Total=600 [2025-02-08 05:49:16,533 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 40 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:16,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 296 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 05:49:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-08 05:49:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2025-02-08 05:49:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.210144927536232) internal successors, (167), 140 states have internal predecessors, (167), 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-08 05:49:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2025-02-08 05:49:16,538 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 23 [2025-02-08 05:49:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:16,538 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2025-02-08 05:49:16,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 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-08 05:49:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2025-02-08 05:49:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 05:49:16,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:16,539 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-08 05:49:16,548 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-08 05:49:16,742 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-08 05:49:16,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:16,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1314480330, now seen corresponding path program 2 times [2025-02-08 05:49:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:16,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211175358] [2025-02-08 05:49:16,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:16,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 05:49:16,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:49:16,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:16,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:16,972 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-08 05:49:16,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211175358] [2025-02-08 05:49:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211175358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762869619] [2025-02-08 05:49:16,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:16,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:16,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:16,977 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-08 05:49:16,980 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-08 05:49:17,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 05:49:17,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:49:17,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:17,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:17,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 05:49:17,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:17,337 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-08 05:49:17,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2025-02-08 05:49:17,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:17,388 INFO L349 Elim1Store]: treesize reduction 63, result has 7.4 percent of original size [2025-02-08 05:49:17,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 54 [2025-02-08 05:49:17,400 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2025-02-08 05:49:17,401 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 173 treesize of output 142 [2025-02-08 05:49:17,410 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-08 05:49:17,414 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 52 treesize of output 16 [2025-02-08 05:49:17,420 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-08 05:49:17,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:17,493 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-08 05:49:17,494 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 78 treesize of output 55 [2025-02-08 05:49:17,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:17,511 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-02-08 05:49:17,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 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-08 05:49:17,522 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 23 treesize of output 16 [2025-02-08 05:49:17,580 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-08 05:49:17,580 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 76 treesize of output 53 [2025-02-08 05:49:17,588 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 23 treesize of output 16 [2025-02-08 05:49:17,716 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-08 05:49:17,761 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:49:17,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 26 [2025-02-08 05:49:17,767 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-08 05:49:17,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:17,817 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1244))) (select .cse0 (select (select .cse0 |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_1245) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2025-02-08 05:49:17,849 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-08 05:49:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762869619] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:17,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-08 05:49:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561904415] [2025-02-08 05:49:17,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:49:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:17,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:49:17,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=220, Unknown=3, NotChecked=30, Total=306 [2025-02-08 05:49:17,850 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-08 05:49:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:18,742 INFO L93 Difference]: Finished difference Result 231 states and 282 transitions. [2025-02-08 05:49:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:49:18,742 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-08 05:49:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:18,743 INFO L225 Difference]: With dead ends: 231 [2025-02-08 05:49:18,743 INFO L226 Difference]: Without dead ends: 231 [2025-02-08 05:49:18,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=657, Unknown=3, NotChecked=56, Total=930 [2025-02-08 05:49:18,744 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 324 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:18,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 435 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 445 Invalid, 0 Unknown, 152 Unchecked, 0.5s Time] [2025-02-08 05:49:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-08 05:49:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 166. [2025-02-08 05:49:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 162 states have (on average 1.228395061728395) internal successors, (199), 164 states have internal predecessors, (199), 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-08 05:49:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 201 transitions. [2025-02-08 05:49:18,749 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 201 transitions. Word has length 23 [2025-02-08 05:49:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:18,749 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 201 transitions. [2025-02-08 05:49:18,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-08 05:49:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 201 transitions. [2025-02-08 05:49:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 05:49:18,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:18,750 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:18,757 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-08 05:49:18,950 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-08 05:49:18,951 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:18,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1223017730, now seen corresponding path program 3 times [2025-02-08 05:49:18,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:18,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754715293] [2025-02-08 05:49:18,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-02-08 05:49:18,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:49:18,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 05:49:18,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:19,506 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-08 05:49:19,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754715293] [2025-02-08 05:49:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754715293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894990822] [2025-02-08 05:49:19,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:19,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:19,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:19,509 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-08 05:49:19,511 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-08 05:49:19,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-02-08 05:49:20,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:49:20,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 05:49:20,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:20,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-08 05:49:20,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:20,078 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-08 05:49:20,082 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-08 05:49:20,101 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-02-08 05:49:20,101 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 96 treesize of output 84 [2025-02-08 05:49:20,109 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-08 05:49:20,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:20,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:20,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:20,118 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-08 05:49:20,220 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-08 05:49:20,234 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-02-08 05:49:20,234 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 4 case distinctions, treesize of input 93 treesize of output 58 [2025-02-08 05:49:20,337 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 05:49:20,341 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-08 05:49:20,404 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-02-08 05:49:20,404 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 4 case distinctions, treesize of input 100 treesize of output 54 [2025-02-08 05:49:20,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:49:20,497 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 88 treesize of output 47 [2025-02-08 05:49:20,649 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-08 05:49:20,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:20,712 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 Int)) (= |c_ULTIMATE.start_main_old_#valid#1| (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_1406)) .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))))) is different from false [2025-02-08 05:49:20,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 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_1406)) .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-08 05:49:20,724 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-08 05:49:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894990822] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:20,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:20,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2025-02-08 05:49:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583104909] [2025-02-08 05:49:20,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 05:49:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:20,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 05:49:20,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=284, Unknown=2, NotChecked=70, Total=420 [2025-02-08 05:49:20,725 INFO L87 Difference]: Start difference. First operand 166 states and 201 transitions. Second operand has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:21,085 INFO L93 Difference]: Finished difference Result 178 states and 214 transitions. [2025-02-08 05:49:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:49:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 05:49:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:21,086 INFO L225 Difference]: With dead ends: 178 [2025-02-08 05:49:21,086 INFO L226 Difference]: Without dead ends: 177 [2025-02-08 05:49:21,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=284, Unknown=2, NotChecked=70, Total=420 [2025-02-08 05:49:21,086 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:21,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 395 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 120 Unchecked, 0.3s Time] [2025-02-08 05:49:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-08 05:49:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 166. [2025-02-08 05:49:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 162 states have (on average 1.2222222222222223) internal successors, (198), 164 states have internal predecessors, (198), 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-08 05:49:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2025-02-08 05:49:21,090 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 24 [2025-02-08 05:49:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:21,090 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2025-02-08 05:49:21,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2025-02-08 05:49:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 05:49:21,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:21,091 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] [2025-02-08 05:49:21,099 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-08 05:49:21,291 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-08 05:49:21,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:21,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:21,292 INFO L85 PathProgramCache]: Analyzing trace with hash -891675349, now seen corresponding path program 3 times [2025-02-08 05:49:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:21,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149238542] [2025-02-08 05:49:21,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:21,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-02-08 05:49:21,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:49:21,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 05:49:21,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:49:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149238542] [2025-02-08 05:49:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149238542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455702789] [2025-02-08 05:49:21,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:21,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:21,928 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-08 05:49:21,930 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-08 05:49:22,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-02-08 05:49:22,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:49:22,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 05:49:22,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:22,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 05:49:22,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:22,508 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-08 05:49:22,513 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-08 05:49:22,521 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 24 treesize of output 28 [2025-02-08 05:49:22,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:22,538 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2025-02-08 05:49:22,538 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 43 treesize of output 38 [2025-02-08 05:49:22,552 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-02-08 05:49:22,553 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-08 05:49:22,558 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-08 05:49:22,563 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-08 05:49:22,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:22,628 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-08 05:49:22,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:22,632 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-08 05:49:22,647 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2025-02-08 05:49:22,648 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-08 05:49:22,659 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-08 05:49:22,696 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-08 05:49:22,699 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-08 05:49:22,713 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-08 05:49:22,880 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-08 05:49:22,884 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-08 05:49:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:49:22,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:23,005 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1568 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1570 (Array Int 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_1570) |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_1568) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1)) is different from false [2025-02-08 05:49:23,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:23,016 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-08 05:49:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:49:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455702789] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:23,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-08 05:49:23,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654012308] [2025-02-08 05:49:23,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:23,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:49:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:23,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:49:23,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=291, Unknown=1, NotChecked=34, Total=380 [2025-02-08 05:49:23,058 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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-08 05:49:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:24,025 INFO L93 Difference]: Finished difference Result 290 states and 354 transitions. [2025-02-08 05:49:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:49:24,025 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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 25 [2025-02-08 05:49:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:24,026 INFO L225 Difference]: With dead ends: 290 [2025-02-08 05:49:24,026 INFO L226 Difference]: Without dead ends: 290 [2025-02-08 05:49:24,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=631, Unknown=1, NotChecked=54, Total=870 [2025-02-08 05:49:24,027 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 237 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:24,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 478 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 528 Invalid, 0 Unknown, 136 Unchecked, 0.6s Time] [2025-02-08 05:49:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-08 05:49:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 217. [2025-02-08 05:49:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 213 states have (on average 1.2206572769953052) internal successors, (260), 215 states have internal predecessors, (260), 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-08 05:49:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2025-02-08 05:49:24,035 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 25 [2025-02-08 05:49:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:24,035 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2025-02-08 05:49:24,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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-08 05:49:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2025-02-08 05:49:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 05:49:24,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:24,036 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] [2025-02-08 05:49:24,047 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-08 05:49:24,236 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-08 05:49:24,236 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:24,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:24,237 INFO L85 PathProgramCache]: Analyzing trace with hash -680324436, now seen corresponding path program 1 times [2025-02-08 05:49:24,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:24,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155133096] [2025-02-08 05:49:24,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:24,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:24,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:49:24,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:49:24,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:24,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:24,661 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-08 05:49:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155133096] [2025-02-08 05:49:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155133096] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001346299] [2025-02-08 05:49:24,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:24,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:24,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:24,664 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:24,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 05:49:24,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:49:24,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:49:24,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:24,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:24,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-08 05:49:24,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:24,841 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-08 05:49:24,846 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-08 05:49:24,874 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-02-08 05:49:24,875 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-08 05:49:24,879 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 15 [2025-02-08 05:49:24,886 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-08 05:49:24,914 INFO L349 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2025-02-08 05:49:24,914 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-08 05:49:24,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:24,924 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 52 treesize of output 31 [2025-02-08 05:49:24,926 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-08 05:49:24,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:25,004 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-08 05:49:25,004 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 107 treesize of output 76 [2025-02-08 05:49:25,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:25,030 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2025-02-08 05:49:25,030 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2025-02-08 05:49:25,055 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-02-08 05:49:25,056 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 1 case distinctions, treesize of input 24 treesize of output 31 [2025-02-08 05:49:25,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:25,078 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-02-08 05:49:25,078 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-08 05:49:25,147 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-08 05:49:25,148 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 105 treesize of output 74 [2025-02-08 05:49:25,153 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-08 05:49:25,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:25,169 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 45 treesize of output 35 [2025-02-08 05:49:25,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:49:25,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 108 treesize of output 51 [2025-02-08 05:49:25,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-08 05:49:25,711 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-08 05:49:25,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:25,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int))) (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1725)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1724))) (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-08 05:49:25,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:25,782 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-08 05:49:25,847 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-08 05:49:25,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001346299] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:25,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:25,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 05:49:25,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850267850] [2025-02-08 05:49:25,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:25,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 05:49:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:25,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 05:49:25,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2025-02-08 05:49:25,849 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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-08 05:49:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:27,059 INFO L93 Difference]: Finished difference Result 342 states and 415 transitions. [2025-02-08 05:49:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 05:49:27,060 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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 25 [2025-02-08 05:49:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:27,061 INFO L225 Difference]: With dead ends: 342 [2025-02-08 05:49:27,061 INFO L226 Difference]: Without dead ends: 342 [2025-02-08 05:49:27,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=786, Unknown=1, NotChecked=60, Total=1056 [2025-02-08 05:49:27,062 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 272 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:27,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 537 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 633 Invalid, 0 Unknown, 154 Unchecked, 0.7s Time] [2025-02-08 05:49:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-08 05:49:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 260. [2025-02-08 05:49:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 256 states have (on average 1.22265625) internal successors, (313), 258 states have internal predecessors, (313), 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-08 05:49:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 315 transitions. [2025-02-08 05:49:27,070 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 315 transitions. Word has length 25 [2025-02-08 05:49:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:27,070 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 315 transitions. [2025-02-08 05:49:27,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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-08 05:49:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 315 transitions. [2025-02-08 05:49:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 05:49:27,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:27,072 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] [2025-02-08 05:49:27,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 05:49:27,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 05:49:27,277 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:27,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash -272045035, now seen corresponding path program 1 times [2025-02-08 05:49:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:27,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753320829] [2025-02-08 05:49:27,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:27,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:27,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:49:27,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:49:27,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:27,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:49:27,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:49:27,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:49:27,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:49:27,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:27,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:49:27,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:49:27,351 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:49:27,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-08 05:49:27,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-08 05:49:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:49:27,355 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:27,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:49:27,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:49:27 BoogieIcfgContainer [2025-02-08 05:49:27,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:49:27,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:49:27,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:49:27,378 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:49:27,378 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:56" (3/4) ... [2025-02-08 05:49:27,378 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:49:27,417 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 24. [2025-02-08 05:49:27,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:49:27,467 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:49:27,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:49:27,467 INFO L158 Benchmark]: Toolchain (without parser) took 31955.41ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 106.6MB in the beginning and 359.7MB in the end (delta: -253.1MB). Peak memory consumption was 233.5MB. Max. memory is 16.1GB. [2025-02-08 05:49:27,468 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:27,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.57ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 88.6MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:49:27,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.52ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 87.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:27,469 INFO L158 Benchmark]: Boogie Preprocessor took 44.34ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:27,469 INFO L158 Benchmark]: IcfgBuilder took 363.28ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 65.6MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:49:27,470 INFO L158 Benchmark]: TraceAbstraction took 31083.50ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 65.6MB in the beginning and 368.1MB in the end (delta: -302.5MB). Peak memory consumption was 191.5MB. Max. memory is 16.1GB. [2025-02-08 05:49:27,470 INFO L158 Benchmark]: Witness Printer took 89.31ms. Allocated memory is still 629.1MB. Free memory was 368.1MB in the beginning and 359.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:27,471 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.14ms. Allocated memory is still 226.5MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.57ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 88.6MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.52ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 87.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.34ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 363.28ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 65.6MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31083.50ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 65.6MB in the beginning and 368.1MB in the end (delta: -302.5MB). Peak memory consumption was 191.5MB. Max. memory is 16.1GB. * Witness Printer took 89.31ms. Allocated memory is still 629.1MB. Free memory was 368.1MB in the beginning and 359.7MB in the end (delta: 8.4MB). There was no memory consumed. 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, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 31.0s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1485 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1485 mSDsluCounter, 3700 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 562 IncrementalHoareTripleChecker+Unchecked, 3102 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3226 IncrementalHoareTripleChecker+Invalid, 3938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 598 mSDtfsCounter, 3226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 531 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 213 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=14, InterpolantAutomatonStates: 137, 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, 14 MinimizatonAttempts, 360 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 606 ConstructedInterpolants, 71 QuantifiedInterpolants, 19624 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2384 ConjunctsInSsa, 472 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 50/226 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-08 05:49:27,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)