./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-1.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/list-properties/list_search-1.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 ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:49:04,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:49:04,655 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:49:04,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:49:04,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:49:04,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:49:04,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:49:04,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:49:04,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:49:04,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:49:04,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:49:04,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:49:04,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:49:04,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:49:04,679 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:49:04,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:49:04,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:49:04,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:49:04,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:49:04,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:49:04,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:49:04,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:49:04,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:04,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:49:04,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:49:04,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:49:04,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:49:04,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:49:04,682 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 -> ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 [2025-02-08 05:49:04,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:49:04,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:49:04,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:49:04,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:49:04,969 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:49:04,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2025-02-08 05:49:06,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc6fbb319/0072b6e0e8954aeda503bc582dd68b2b/FLAGa14dc055f [2025-02-08 05:49:06,427 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:49:06,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2025-02-08 05:49:06,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc6fbb319/0072b6e0e8954aeda503bc582dd68b2b/FLAGa14dc055f [2025-02-08 05:49:06,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc6fbb319/0072b6e0e8954aeda503bc582dd68b2b [2025-02-08 05:49:06,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:49:06,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:49:06,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:06,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:49:06,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:49:06,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:06,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24983486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06, skipping insertion in model container [2025-02-08 05:49:06,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:06,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:49:06,923 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:49:06,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:06,933 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:49:06,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:06,978 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:49:06,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06 WrapperNode [2025-02-08 05:49:06,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:06,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:06,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:49:06,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:49:06,985 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:49:06" (1/1) ... [2025-02-08 05:49:06,992 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:49:06" (1/1) ... [2025-02-08 05:49:07,004 INFO L138 Inliner]: procedures = 125, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2025-02-08 05:49:07,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:07,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:49:07,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:49:07,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:49:07,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,029 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-08 05:49:07,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:49:07,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:49:07,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:49:07,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:49:07,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (1/1) ... [2025-02-08 05:49:07,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:07,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:07,070 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:49:07,075 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:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2025-02-08 05:49:07,092 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:49:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:49:07,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:49:07,189 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:49:07,192 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:49:07,347 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-02-08 05:49:07,347 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:49:07,354 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:49:07,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:49:07,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:07 BoogieIcfgContainer [2025-02-08 05:49:07,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:49:07,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:49:07,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:49:07,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:49:07,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:49:06" (1/3) ... [2025-02-08 05:49:07,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7203dbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:07, skipping insertion in model container [2025-02-08 05:49:07,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:06" (2/3) ... [2025-02-08 05:49:07,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7203dbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:07, skipping insertion in model container [2025-02-08 05:49:07,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:07" (3/3) ... [2025-02-08 05:49:07,362 INFO L128 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2025-02-08 05:49:07,373 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:49:07,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_search-1.i that has 2 procedures, 29 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-08 05:49:07,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:49:07,419 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;@3bde8e55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:49:07,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:49:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 05:49:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 05:49:07,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:07,429 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:07,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:07,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:07,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2000440600, now seen corresponding path program 1 times [2025-02-08 05:49:07,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:07,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694348655] [2025-02-08 05:49:07,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:07,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:49:07,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:49:07,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:07,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:07,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694348655] [2025-02-08 05:49:07,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694348655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:07,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791553394] [2025-02-08 05:49:07,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:07,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:07,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:07,884 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:49:07,885 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:49:07,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:49:08,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:49:08,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:08,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:08,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 05:49:08,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 05:49:08,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:49:08,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791553394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:08,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:49:08,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2025-02-08 05:49:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655141120] [2025-02-08 05:49:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:49:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:08,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:49:08,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:49:08,079 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:08,090 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-02-08 05:49:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:49:08,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-02-08 05:49:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:08,095 INFO L225 Difference]: With dead ends: 28 [2025-02-08 05:49:08,096 INFO L226 Difference]: Without dead ends: 26 [2025-02-08 05:49:08,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:49:08,099 INFO L435 NwaCegarLoop]: 34 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, 34 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:49:08,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-08 05:49:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-08 05:49:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 05:49:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-02-08 05:49:08,129 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 34 [2025-02-08 05:49:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:08,130 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-02-08 05:49:08,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-02-08 05:49:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 05:49:08,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:08,132 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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:08,141 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:49:08,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 05:49:08,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1833387669, now seen corresponding path program 1 times [2025-02-08 05:49:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719629141] [2025-02-08 05:49:08,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:08,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:49:08,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:49:08,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:08,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719629141] [2025-02-08 05:49:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719629141] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213228253] [2025-02-08 05:49:08,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:08,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:08,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:08,500 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:49:08,501 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:49:08,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:49:08,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:49:08,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:08,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:08,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 05:49:08,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:08,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:08,694 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 23 treesize of output 11 [2025-02-08 05:49:08,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 05:49:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:08,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:49:08,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213228253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:08,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:49:08,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-02-08 05:49:08,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266890633] [2025-02-08 05:49:08,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:08,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:49:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:08,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:49:08,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:49:08,841 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:09,038 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2025-02-08 05:49:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:49:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-02-08 05:49:09,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:09,040 INFO L225 Difference]: With dead ends: 52 [2025-02-08 05:49:09,040 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 05:49:09,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:49:09,041 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:09,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 95 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 05:49:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2025-02-08 05:49:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 05:49:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-02-08 05:49:09,049 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 36 [2025-02-08 05:49:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:09,049 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-02-08 05:49:09,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-02-08 05:49:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 05:49:09,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:09,051 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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:09,057 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:09,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:09,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:09,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1862016820, now seen corresponding path program 1 times [2025-02-08 05:49:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:09,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412156830] [2025-02-08 05:49:09,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:09,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:49:09,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:49:09,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:09,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412156830] [2025-02-08 05:49:09,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412156830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505041182] [2025-02-08 05:49:09,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:09,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:09,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:09,343 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:09,344 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:09,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:49:09,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:49:09,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:09,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:09,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 05:49:09,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:09,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505041182] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:09,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:09,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-08 05:49:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647369470] [2025-02-08 05:49:09,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:09,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:49:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:09,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:49:09,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:49:09,551 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 05:49:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:09,616 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-02-08 05:49:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:49:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 36 [2025-02-08 05:49:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:09,617 INFO L225 Difference]: With dead ends: 33 [2025-02-08 05:49:09,618 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 05:49:09,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:49:09,619 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:09,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 05:49:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-02-08 05:49:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-02-08 05:49:09,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 36 [2025-02-08 05:49:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:09,622 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-02-08 05:49:09,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 05:49:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-02-08 05:49:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 05:49:09,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:09,623 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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:09,629 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:09,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:09,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:09,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1149018324, now seen corresponding path program 1 times [2025-02-08 05:49:09,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:09,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823375181] [2025-02-08 05:49:09,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:09,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:49:09,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:49:09,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:09,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:10,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823375181] [2025-02-08 05:49:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823375181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:10,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:49:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238005340] [2025-02-08 05:49:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:10,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:49:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:10,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:49:10,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:10,209 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:10,337 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-02-08 05:49:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:49:10,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-02-08 05:49:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:10,338 INFO L225 Difference]: With dead ends: 38 [2025-02-08 05:49:10,338 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 05:49:10,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:49:10,340 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:10,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 94 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 05:49:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-02-08 05:49:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-02-08 05:49:10,347 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 36 [2025-02-08 05:49:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:10,347 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-02-08 05:49:10,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-02-08 05:49:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 05:49:10,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:10,349 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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:10,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:49:10,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:10,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:10,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1177647475, now seen corresponding path program 1 times [2025-02-08 05:49:10,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:10,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016575231] [2025-02-08 05:49:10,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:10,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:49:10,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:49:10,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:10,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016575231] [2025-02-08 05:49:10,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016575231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:10,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:10,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:49:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276702054] [2025-02-08 05:49:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:10,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:49:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:10,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:49:10,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:49:10,484 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:10,530 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-02-08 05:49:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:49:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-02-08 05:49:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:10,531 INFO L225 Difference]: With dead ends: 36 [2025-02-08 05:49:10,533 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 05:49:10,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:49:10,537 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:10,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 97 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 05:49:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-02-08 05:49:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-08 05:49:10,539 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 36 [2025-02-08 05:49:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:10,539 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-08 05:49:10,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-02-08 05:49:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 05:49:10,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:10,540 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 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:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:49:10,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:10,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash -912948327, now seen corresponding path program 1 times [2025-02-08 05:49:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:10,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448639730] [2025-02-08 05:49:10,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:10,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:49:10,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:49:10,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:10,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 05:49:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448639730] [2025-02-08 05:49:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448639730] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947227803] [2025-02-08 05:49:11,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:11,535 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:11,536 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:11,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:49:11,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:49:11,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:11,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:11,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 05:49:11,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:11,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:49:11,718 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-08 05:49:11,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:11,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:11,847 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 05:49:11,847 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 15 treesize of output 15 [2025-02-08 05:49:11,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 05:49:11,921 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 27 treesize of output 15 [2025-02-08 05:49:11,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 05:49:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:11,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:12,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947227803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:12,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:12,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2025-02-08 05:49:12,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996019562] [2025-02-08 05:49:12,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:12,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:49:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:12,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:49:12,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-02-08 05:49:12,157 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 05:49:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:12,607 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-02-08 05:49:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 05:49:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2025-02-08 05:49:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:12,608 INFO L225 Difference]: With dead ends: 45 [2025-02-08 05:49:12,608 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 05:49:12,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 05:49:12,609 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:12,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 205 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:49:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 05:49:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 05:49:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-02-08 05:49:12,614 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 39 [2025-02-08 05:49:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:12,615 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-02-08 05:49:12,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 05:49:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-02-08 05:49:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 05:49:12,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:12,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:12,623 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:12,818 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,SelfDestructingSolverStorable5 [2025-02-08 05:49:12,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:12,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1169243848, now seen corresponding path program 1 times [2025-02-08 05:49:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109656929] [2025-02-08 05:49:12,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:49:12,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:49:12,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:12,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 05:49:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109656929] [2025-02-08 05:49:12,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109656929] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:12,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028334098] [2025-02-08 05:49:12,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:12,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:12,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:12,989 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:12,990 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:13,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:49:13,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:49:13,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:13,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 05:49:13,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:13,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:13,250 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 16 treesize of output 8 [2025-02-08 05:49:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:13,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 05:49:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028334098] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:13,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 19 [2025-02-08 05:49:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951066106] [2025-02-08 05:49:13,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:13,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 05:49:13,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:13,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 05:49:13,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:49:13,362 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 05:49:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:13,768 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-02-08 05:49:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 05:49:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 41 [2025-02-08 05:49:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:13,769 INFO L225 Difference]: With dead ends: 56 [2025-02-08 05:49:13,769 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 05:49:13,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 05:49:13,770 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 93 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:13,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 159 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 05:49:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2025-02-08 05:49:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 05:49:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-02-08 05:49:13,774 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 41 [2025-02-08 05:49:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:13,774 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-02-08 05:49:13,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 05:49:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-02-08 05:49:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 05:49:13,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:13,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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:13,781 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:13,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:13,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:13,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1955786420, now seen corresponding path program 2 times [2025-02-08 05:49:13,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341977384] [2025-02-08 05:49:13,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:13,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:13,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-08 05:49:14,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:49:14,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:14,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:49:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341977384] [2025-02-08 05:49:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341977384] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062885679] [2025-02-08 05:49:15,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:15,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:15,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:15,578 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:15,579 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:15,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-08 05:49:15,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:49:15,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:15,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:15,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-02-08 05:49:15,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:15,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:49:15,787 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-02-08 05:49:15,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:15,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:16,140 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:16,141 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 20 treesize of output 23 [2025-02-08 05:49:16,162 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-02-08 05:49:16,163 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 2 case distinctions, treesize of input 21 treesize of output 29 [2025-02-08 05:49:16,268 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 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:16,276 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 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:16,406 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:16,406 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 20 treesize of output 23 [2025-02-08 05:49:16,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:16,418 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 53 treesize of output 36 [2025-02-08 05:49:16,440 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-02-08 05:49:16,441 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 1 case distinctions, treesize of input 24 treesize of output 31 [2025-02-08 05:49:16,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:16,459 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-02-08 05:49:16,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2025-02-08 05:49:16,737 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:49:16,737 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 66 treesize of output 33 [2025-02-08 05:49:16,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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:16,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 05:49:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:49:16,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:17,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:17,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2025-02-08 05:49:17,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:17,090 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:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062885679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:17,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:17,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 34 [2025-02-08 05:49:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040428533] [2025-02-08 05:49:17,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:17,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 05:49:17,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:17,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 05:49:17,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1464, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 05:49:17,188 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 30 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-08 05:49:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:18,690 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-02-08 05:49:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 05:49:18,691 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 30 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 42 [2025-02-08 05:49:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:18,691 INFO L225 Difference]: With dead ends: 59 [2025-02-08 05:49:18,691 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 05:49:18,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=326, Invalid=3214, Unknown=0, NotChecked=0, Total=3540 [2025-02-08 05:49:18,693 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 94 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:18,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 360 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 05:49:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 05:49:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-02-08 05:49:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 46 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 05:49:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2025-02-08 05:49:18,700 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 42 [2025-02-08 05:49:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:18,701 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2025-02-08 05:49:18,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 30 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-08 05:49:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2025-02-08 05:49:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 05:49:18,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:18,703 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 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:18,710 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:18,903 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,SelfDestructingSolverStorable7 [2025-02-08 05:49:18,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:18,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1984415571, now seen corresponding path program 1 times [2025-02-08 05:49:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881439554] [2025-02-08 05:49:18,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:49:18,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:49:18,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:49:19,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:19,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881439554] [2025-02-08 05:49:19,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881439554] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:19,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856733405] [2025-02-08 05:49:19,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:19,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:19,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:19,561 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:19,562 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:19,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:49:19,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:49:19,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:19,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:19,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 05:49:19,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:19,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:49:19,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:19,772 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 0 case distinctions, treesize of input 11 treesize of output 14 [2025-02-08 05:49:19,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 05:49:19,834 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2025-02-08 05:49:19,834 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 23 treesize of output 28 [2025-02-08 05:49:19,850 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-02-08 05:49:19,850 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 17 treesize of output 17 [2025-02-08 05:49:19,900 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 9 treesize of output 3 [2025-02-08 05:49:19,949 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 05:49:19,949 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 38 treesize of output 15 [2025-02-08 05:49:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:49:19,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:20,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:20,073 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 18 treesize of output 22 [2025-02-08 05:49:20,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856733405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:20,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:20,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2025-02-08 05:49:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959096953] [2025-02-08 05:49:20,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:20,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 05:49:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:20,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 05:49:20,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2025-02-08 05:49:20,102 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 20 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 05:49:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:20,843 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2025-02-08 05:49:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 05:49:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 20 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2025-02-08 05:49:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:20,844 INFO L225 Difference]: With dead ends: 70 [2025-02-08 05:49:20,844 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 05:49:20,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 05:49:20,845 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:20,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 274 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:49:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 05:49:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2025-02-08 05:49:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 05:49:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-02-08 05:49:20,847 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 42 [2025-02-08 05:49:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:20,848 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-02-08 05:49:20,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 20 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 05:49:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-02-08 05:49:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 05:49:20,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:20,848 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:20,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 05:49:21,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:21,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1121588807, now seen corresponding path program 3 times [2025-02-08 05:49:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:21,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925587346] [2025-02-08 05:49:21,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:21,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-02-08 05:49:21,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:49:21,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 05:49:21,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:49:21,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:49:21,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:49:21,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:49:21,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:21,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:49:21,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:49:21,131 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:49:21,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-08 05:49:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-08 05:49:21,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:49:21,135 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:21,165 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:49:21,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:49:21 BoogieIcfgContainer [2025-02-08 05:49:21,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:49:21,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:49:21,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:49:21,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:49:21,180 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:07" (3/4) ... [2025-02-08 05:49:21,181 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:49:21,214 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 27. [2025-02-08 05:49:21,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:49:21,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:49:21,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:49:21,268 INFO L158 Benchmark]: Toolchain (without parser) took 14584.72ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 121.1MB in the beginning and 433.4MB in the end (delta: -312.3MB). Peak memory consumption was 269.6MB. Max. memory is 16.1GB. [2025-02-08 05:49:21,268 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:21,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.08ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 103.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:49:21,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.89ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 988.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:21,268 INFO L158 Benchmark]: Boogie Preprocessor took 32.97ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 100.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:21,268 INFO L158 Benchmark]: IcfgBuilder took 316.15ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 85.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:49:21,268 INFO L158 Benchmark]: TraceAbstraction took 13810.30ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 85.5MB in the beginning and 171.5MB in the end (delta: -86.0MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2025-02-08 05:49:21,269 INFO L158 Benchmark]: Witness Printer took 99.49ms. Allocated memory is still 478.2MB. Free memory was 171.5MB in the beginning and 433.4MB in the end (delta: -261.9MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2025-02-08 05:49:21,269 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.26ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.08ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 103.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.89ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 988.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.97ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 100.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 316.15ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 85.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13810.30ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 85.5MB in the beginning and 171.5MB in the end (delta: -86.0MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. * Witness Printer took 99.49ms. Allocated memory is still 478.2MB. Free memory was 171.5MB in the beginning and 433.4MB in the end (delta: -261.9MB). Peak memory consumption was 13.1MB. 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: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L533] mlist *head; [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(k)=2, head={0:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=2, head={0:0}, k=2, l={-1:0}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\old(k)=2, head={0:0}, k=2, l={-1:0}] [L550] head = l [L551] return 0; VAL [\old(k)=2, \result=0, head={-1:0}, k=2] [L556] RET insert_list(mylist,2) VAL [head={-1:0}, mylist={66:58}] [L557] CALL insert_list(mylist,5) VAL [\old(k)=5, head={-1:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=5, head={-1:0}, k=5, l={-5:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=5, head={-1:0}, l={-5:0}] [L550] head = l [L551] return 0; VAL [\old(k)=5, \result=0, head={-5:0}] [L557] RET insert_list(mylist,5) VAL [head={-5:0}, mylist={66:58}] [L558] CALL insert_list(mylist,1) VAL [\old(k)=1, head={-5:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=1, head={-5:0}, k=1, l={-3:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=1, head={-5:0}, l={-3:0}] [L550] head = l [L551] return 0; VAL [\old(k)=1, \result=0, head={-3:0}] [L558] RET insert_list(mylist,1) VAL [head={-3:0}, mylist={66:58}] [L559] CALL insert_list(mylist,3) VAL [\old(k)=3, head={-3:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=3, head={-3:0}, k=3, l={-4:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=3, head={-3:0}, l={-4:0}] [L550] head = l [L551] return 0; VAL [\old(k)=3, \result=0, head={-4:0}] [L559] RET insert_list(mylist,3) VAL [head={-4:0}, mylist={66:58}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [head={-4:0}, k=2, l={-4:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-4:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-4:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] COND TRUE l!=((void *)0) && l->key!=k [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-3:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-3:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] COND TRUE l!=((void *)0) && l->key!=k [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-5:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-5:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] COND TRUE l!=((void *)0) && l->key!=k [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-1:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-1:0}] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) [L15] CALL reach_error() [L12] COND FALSE !(0) VAL [head={-4:0}] [L12] __assert_fail ("0", "list_search-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [head={-4:0}] - UnprovableResult [Line: 553]: 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, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 1416 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1209 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1936 IncrementalHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 207 mSDtfsCounter, 1936 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=8, InterpolantAutomatonStates: 125, 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, 9 MinimizatonAttempts, 50 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 671 ConstructedInterpolants, 6 QuantifiedInterpolants, 6485 SizeOfPredicates, 36 NumberOfNonLiveVariables, 2706 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 422/594 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:21,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)