./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:40:34,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:40:34,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-06 09:40:34,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:40:34,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:40:34,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:40:34,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:40:34,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:40:34,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:40:34,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:40:34,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:40:34,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:40:34,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:40:34,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:40:34,263 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:40:34,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:40:34,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:40:34,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:40:34,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:40:34,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:40:34,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:40:34,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:40:34,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:40:34,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:40:34,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:40:34,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:40:34,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:40:34,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:40:34,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:40:34,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:40:34,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:40:34,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:40:34,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:40:34,265 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2025-02-06 09:40:34,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:40:34,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:40:34,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:40:34,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:40:34,579 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:40:34,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2025-02-06 09:40:35,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b70235ad/136da4cc1dbf45a69264780e8733df41/FLAGe59162efb [2025-02-06 09:40:36,233 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:40:36,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2025-02-06 09:40:36,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b70235ad/136da4cc1dbf45a69264780e8733df41/FLAGe59162efb [2025-02-06 09:40:36,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b70235ad/136da4cc1dbf45a69264780e8733df41 [2025-02-06 09:40:36,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:40:36,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:40:36,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:40:36,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:40:36,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:40:36,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7571a21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36, skipping insertion in model container [2025-02-06 09:40:36,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:40:36,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:40:36,594 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:40:36,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:40:36,663 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:40:36,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36 WrapperNode [2025-02-06 09:40:36,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:40:36,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:40:36,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:40:36,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:40:36,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,705 INFO L138 Inliner]: procedures = 125, calls = 84, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 269 [2025-02-06 09:40:36,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:40:36,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:40:36,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:40:36,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:40:36,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,743 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 34, 3, 10]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 8, 2, 3]. [2025-02-06 09:40:36,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:40:36,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:40:36,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:40:36,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:40:36,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (1/1) ... [2025-02-06 09:40:36,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:40:36,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:36,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:40:36,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:40:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:40:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:40:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 09:40:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2025-02-06 09:40:36,821 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-06 09:40:36,821 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 09:40:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 09:40:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:40:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:40:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 09:40:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 09:40:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:40:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:40:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:40:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 09:40:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 09:40:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:40:36,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:40:36,954 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:40:36,956 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:40:37,360 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-02-06 09:40:37,360 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:40:37,373 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:40:37,373 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:40:37,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:37 BoogieIcfgContainer [2025-02-06 09:40:37,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:40:37,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:40:37,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:40:37,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:40:37,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:40:36" (1/3) ... [2025-02-06 09:40:37,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcb4cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:40:37, skipping insertion in model container [2025-02-06 09:40:37,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:36" (2/3) ... [2025-02-06 09:40:37,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcb4cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:40:37, skipping insertion in model container [2025-02-06 09:40:37,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:37" (3/3) ... [2025-02-06 09:40:37,386 INFO L128 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2025-02-06 09:40:37,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:40:37,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG merge_sort-1.i that has 3 procedures, 102 locations, 1 initial locations, 20 loop locations, and 2 error locations. [2025-02-06 09:40:37,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:40:37,456 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;@46cc1d76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:40:37,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 09:40:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 82 states have (on average 1.7560975609756098) internal successors, (144), 99 states have internal predecessors, (144), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 09:40:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 09:40:37,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:37,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 09:40:37,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 192737240, now seen corresponding path program 1 times [2025-02-06 09:40:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:37,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947489800] [2025-02-06 09:40:37,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:37,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 09:40:37,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 09:40:37,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:37,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:37,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:37,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947489800] [2025-02-06 09:40:37,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947489800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:37,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:37,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:40:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476477718] [2025-02-06 09:40:37,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:37,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:40:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:37,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:40:37,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:40:37,606 INFO L87 Difference]: Start difference. First operand has 102 states, 82 states have (on average 1.7560975609756098) internal successors, (144), 99 states have internal predecessors, (144), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:37,621 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2025-02-06 09:40:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:40:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 09:40:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:37,628 INFO L225 Difference]: With dead ends: 99 [2025-02-06 09:40:37,628 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 09:40:37,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:40:37,633 INFO L435 NwaCegarLoop]: 124 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, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:37,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 09:40:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 09:40:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 94 states have internal predecessors, (105), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2025-02-06 09:40:37,662 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 5 [2025-02-06 09:40:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:37,662 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2025-02-06 09:40:37,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2025-02-06 09:40:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 09:40:37,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:37,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 09:40:37,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:40:37,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:37,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:37,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1679872460, now seen corresponding path program 1 times [2025-02-06 09:40:37,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:37,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947582844] [2025-02-06 09:40:37,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:37,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 09:40:37,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 09:40:37,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:37,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:37,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947582844] [2025-02-06 09:40:37,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947582844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:37,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:40:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522249694] [2025-02-06 09:40:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:37,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:40:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:37,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:40:37,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:37,711 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:37,781 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2025-02-06 09:40:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:40:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 09:40:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:37,784 INFO L225 Difference]: With dead ends: 168 [2025-02-06 09:40:37,784 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 09:40:37,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:37,786 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 71 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:37,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 218 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:40:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 09:40:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 100. [2025-02-06 09:40:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.329268292682927) internal successors, (109), 97 states have internal predecessors, (109), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2025-02-06 09:40:37,796 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 6 [2025-02-06 09:40:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:37,797 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2025-02-06 09:40:37,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2025-02-06 09:40:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 09:40:37,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:37,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:37,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:40:37,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:37,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1785675783, now seen corresponding path program 1 times [2025-02-06 09:40:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340879926] [2025-02-06 09:40:37,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:37,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 09:40:37,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 09:40:37,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:37,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:37,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340879926] [2025-02-06 09:40:37,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340879926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:37,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:37,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:40:37,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619748513] [2025-02-06 09:40:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:37,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:40:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:37,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:40:37,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:37,880 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:37,905 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2025-02-06 09:40:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:40:37,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 09:40:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:37,906 INFO L225 Difference]: With dead ends: 104 [2025-02-06 09:40:37,906 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 09:40:37,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:37,907 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:37,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 234 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 09:40:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2025-02-06 09:40:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 96 states have internal predecessors, (107), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2025-02-06 09:40:37,915 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 11 [2025-02-06 09:40:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:37,916 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2025-02-06 09:40:37,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2025-02-06 09:40:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 09:40:37,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:37,916 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:37,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:40:37,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:37,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1103395591, now seen corresponding path program 1 times [2025-02-06 09:40:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922921517] [2025-02-06 09:40:37,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:37,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 09:40:37,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 09:40:37,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:38,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922921517] [2025-02-06 09:40:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922921517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:38,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:38,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:40:38,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015458044] [2025-02-06 09:40:38,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:38,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:40:38,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:38,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:40:38,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:40:38,050 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:38,105 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2025-02-06 09:40:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:38,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 09:40:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:38,106 INFO L225 Difference]: With dead ends: 126 [2025-02-06 09:40:38,107 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 09:40:38,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:38,108 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 69 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:38,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 303 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 09:40:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2025-02-06 09:40:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.308641975308642) internal successors, (106), 96 states have internal predecessors, (106), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-02-06 09:40:38,120 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 12 [2025-02-06 09:40:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:38,120 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-02-06 09:40:38,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2025-02-06 09:40:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 09:40:38,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:38,121 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:38,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:40:38,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:38,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1921211490, now seen corresponding path program 1 times [2025-02-06 09:40:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:38,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487778289] [2025-02-06 09:40:38,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:38,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:40:38,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:40:38,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:38,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:38,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:38,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487778289] [2025-02-06 09:40:38,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487778289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:38,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:38,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:40:38,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419590048] [2025-02-06 09:40:38,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:38,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:38,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:38,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:38,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:38,300 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:38,411 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2025-02-06 09:40:38,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 09:40:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:38,413 INFO L225 Difference]: With dead ends: 155 [2025-02-06 09:40:38,413 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 09:40:38,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:40:38,414 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 138 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:38,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 361 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:40:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 09:40:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 104. [2025-02-06 09:40:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2025-02-06 09:40:38,430 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 17 [2025-02-06 09:40:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:38,431 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2025-02-06 09:40:38,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2025-02-06 09:40:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 09:40:38,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:38,436 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:38,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:40:38,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:38,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1243656451, now seen corresponding path program 1 times [2025-02-06 09:40:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302625872] [2025-02-06 09:40:38,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:38,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:40:38,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:40:38,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:38,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:40:38,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:38,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302625872] [2025-02-06 09:40:38,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302625872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:38,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:40:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297856676] [2025-02-06 09:40:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:38,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:38,610 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:38,745 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2025-02-06 09:40:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 09:40:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:38,746 INFO L225 Difference]: With dead ends: 103 [2025-02-06 09:40:38,746 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 09:40:38,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:38,747 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 12 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:38,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 367 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:40:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 09:40:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 09:40:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 100 states have internal predecessors, (111), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2025-02-06 09:40:38,753 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 25 [2025-02-06 09:40:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:38,753 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2025-02-06 09:40:38,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2025-02-06 09:40:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 09:40:38,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:38,754 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:38,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:40:38,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:38,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 390559033, now seen corresponding path program 1 times [2025-02-06 09:40:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:38,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084030251] [2025-02-06 09:40:38,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:38,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:40:38,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:40:38,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:38,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:40:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084030251] [2025-02-06 09:40:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084030251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:40:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312297369] [2025-02-06 09:40:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:38,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:38,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:38,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:38,892 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:39,025 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-02-06 09:40:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:39,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 09:40:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:39,027 INFO L225 Difference]: With dead ends: 102 [2025-02-06 09:40:39,027 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 09:40:39,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:39,027 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 12 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:39,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 357 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:40:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 09:40:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-06 09:40:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.264367816091954) internal successors, (110), 99 states have internal predecessors, (110), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2025-02-06 09:40:39,039 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 25 [2025-02-06 09:40:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:39,039 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2025-02-06 09:40:39,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2025-02-06 09:40:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 09:40:39,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:39,040 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:39,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:40:39,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:39,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -155278705, now seen corresponding path program 1 times [2025-02-06 09:40:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:39,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556291280] [2025-02-06 09:40:39,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:39,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:40:39,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:40:39,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:39,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:39,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556291280] [2025-02-06 09:40:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556291280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:40:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208827938] [2025-02-06 09:40:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:39,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:40:39,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:40:39,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:39,249 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:39,475 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2025-02-06 09:40:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:40:39,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 09:40:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:39,477 INFO L225 Difference]: With dead ends: 152 [2025-02-06 09:40:39,477 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 09:40:39,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-06 09:40:39,478 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 118 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:39,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 382 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:40:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 09:40:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 108. [2025-02-06 09:40:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 105 states have internal predecessors, (116), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2025-02-06 09:40:39,490 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 28 [2025-02-06 09:40:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:39,490 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2025-02-06 09:40:39,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2025-02-06 09:40:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 09:40:39,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:39,491 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:39,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:40:39,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:39,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash 856006022, now seen corresponding path program 1 times [2025-02-06 09:40:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754006345] [2025-02-06 09:40:39,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:39,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:40:39,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:40:39,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:39,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:40:39,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:39,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754006345] [2025-02-06 09:40:39,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754006345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:39,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:39,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:40:39,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611241145] [2025-02-06 09:40:39,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:39,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:40:39,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:39,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:40:39,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:39,652 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:39,846 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2025-02-06 09:40:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:40:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 09:40:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:39,847 INFO L225 Difference]: With dead ends: 151 [2025-02-06 09:40:39,847 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 09:40:39,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-06 09:40:39,849 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 116 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:39,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 382 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:40:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 09:40:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2025-02-06 09:40:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 111 states have internal predecessors, (122), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:40:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2025-02-06 09:40:39,859 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 28 [2025-02-06 09:40:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:39,859 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2025-02-06 09:40:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:40:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2025-02-06 09:40:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 09:40:39,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:39,860 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:39,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:40:39,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:39,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2114317408, now seen corresponding path program 1 times [2025-02-06 09:40:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:39,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671433589] [2025-02-06 09:40:39,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:39,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:39,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:40:39,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:40:39,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:39,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:40:39,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:40:39,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:40:39,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:40:39,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:39,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:40:39,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:40:39,927 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:40:39,928 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-06 09:40:39,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-06 09:40:39,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:40:39,934 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:39,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:40:39,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:40:39 BoogieIcfgContainer [2025-02-06 09:40:39,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:40:39,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:40:39,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:40:39,967 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:40:39,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:37" (3/4) ... [2025-02-06 09:40:39,968 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 09:40:40,018 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 28. [2025-02-06 09:40:40,086 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:40:40,090 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:40:40,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:40:40,091 INFO L158 Benchmark]: Toolchain (without parser) took 3829.55ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 83.6MB in the end (delta: 75.4MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2025-02-06 09:40:40,092 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:40,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.27ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 140.5MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:40:40,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.18ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 138.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:40,092 INFO L158 Benchmark]: Boogie Preprocessor took 58.26ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 134.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:40:40,092 INFO L158 Benchmark]: IcfgBuilder took 608.78ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 106.6MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:40:40,092 INFO L158 Benchmark]: TraceAbstraction took 2588.86ms. Allocated memory is still 201.3MB. Free memory was 106.2MB in the beginning and 90.4MB in the end (delta: 15.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-02-06 09:40:40,093 INFO L158 Benchmark]: Witness Printer took 124.35ms. Allocated memory is still 201.3MB. Free memory was 90.4MB in the beginning and 83.6MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:40,095 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.27ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 140.5MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.18ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 138.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.26ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 134.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 608.78ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 106.6MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2588.86ms. Allocated memory is still 201.3MB. Free memory was 106.2MB in the beginning and 90.4MB in the end (delta: 15.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 124.35ms. Allocated memory is still 201.3MB. Free memory was 90.4MB in the beginning and 83.6MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node [L644] node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-2:0}, node={-1:0}] [L648] item->slist = node [L649] item->next = data [L650] data = item [L639] COND TRUE __VERIFIER_nondet_int() [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND TRUE 0 VAL [shape={-2:0}] [L615] COND FALSE !(!(shape)) VAL [shape={-2:0}] [L615] COND FALSE !(0) VAL [shape={-2:0}] [L616] COND TRUE shape->next [L616] shape->next [L616] COND FALSE !(shape->next) [L622] COND TRUE 0 VAL [shape={-2:0}] [L622] COND FALSE !(!(shape)) VAL [shape={-2:0}] [L622] COND FALSE !(0) VAL [shape={-2:0}] [L623] COND TRUE 0 [L623] EXPR shape->next [L623] COND FALSE !(!(shape->next == ((void *)0))) [L623] COND FALSE !(0) VAL [shape={-2:0}] [L624] COND TRUE 0 [L624] EXPR shape->slist [L624] COND FALSE !(!(shape->slist)) [L624] COND FALSE !(0) VAL [shape={-2:0}] [L625] COND TRUE 0 [L625] EXPR shape->slist [L625] EXPR shape->slist->next [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "merge_sort-1.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 636]: 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 3 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 540 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 2728 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1748 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 602 IncrementalHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 980 mSDtfsCounter, 602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=9, InterpolantAutomatonStates: 42, 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, 230 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 09:40:40,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)