./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:54:58,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:54:58,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-16 23:54:58,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:54:58,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:54:58,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:54:58,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:54:58,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:54:58,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:54:58,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:54:58,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:54:58,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:54:58,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:54:58,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:54:58,628 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:54:58,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:54:58,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:54:58,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:54:58,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:54:58,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:54:58,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:54:58,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:54:58,631 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:54:58,632 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:54:58,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:54:58,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:54:58,632 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:54:58,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:54:58,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:54:58,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:54:58,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:54:58,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:54:58,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:54:58,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:54:58,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:54:58,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:54:58,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:54:58,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:54:58,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:54:58,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:54:58,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:54:58,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:54:58,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:54:58,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:54:58,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:54:58,637 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 [2024-11-16 23:54:58,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:54:58,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:54:58,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:54:58,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:54:58,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:54:58,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2024-11-16 23:55:00,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:55:00,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:55:00,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2024-11-16 23:55:00,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76132593e/19a82bfc8e7440609c413456ca8d3440/FLAG9ad614f96 [2024-11-16 23:55:00,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76132593e/19a82bfc8e7440609c413456ca8d3440 [2024-11-16 23:55:00,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:55:00,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:55:00,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:55:00,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:55:00,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:55:00,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eda8d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00, skipping insertion in model container [2024-11-16 23:55:00,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:55:00,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:55:00,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:55:00,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:55:00,866 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:55:00,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00 WrapperNode [2024-11-16 23:55:00,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:55:00,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:55:00,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:55:00,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:55:00,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,905 INFO L138 Inliner]: procedures = 125, calls = 84, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 273 [2024-11-16 23:55:00,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:55:00,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:55:00,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:55:00,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:55:00,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,958 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 34, 10, 3]. 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, 3, 2]. [2024-11-16 23:55:00,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:55:00,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:55:00,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:55:00,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:55:00,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (1/1) ... [2024-11-16 23:55:00,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:55:00,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:55:01,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:55:01,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:55:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 23:55:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 23:55:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 23:55:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2024-11-16 23:55:01,042 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-16 23:55:01,042 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:55:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 23:55:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 23:55:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 23:55:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-16 23:55:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 23:55:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 23:55:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 23:55:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-16 23:55:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:55:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 23:55:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 23:55:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 23:55:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 23:55:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:55:01,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:55:01,187 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:55:01,189 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:55:01,473 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-16 23:55:01,473 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:55:01,486 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:55:01,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:55:01,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:55:01 BoogieIcfgContainer [2024-11-16 23:55:01,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:55:01,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:55:01,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:55:01,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:55:01,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:55:00" (1/3) ... [2024-11-16 23:55:01,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270ce6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:55:01, skipping insertion in model container [2024-11-16 23:55:01,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:00" (2/3) ... [2024-11-16 23:55:01,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270ce6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:55:01, skipping insertion in model container [2024-11-16 23:55:01,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:55:01" (3/3) ... [2024-11-16 23:55:01,495 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2024-11-16 23:55:01,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:55:01,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 23:55:01,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:55:01,547 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;@13bb5425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:55:01,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 23:55:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 87 states have (on average 1.735632183908046) internal successors, (151), 104 states have internal predecessors, (151), 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) [2024-11-16 23:55:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 23:55:01,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:01,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 23:55:01,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:01,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2005304881, now seen corresponding path program 1 times [2024-11-16 23:55:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:01,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825065213] [2024-11-16 23:55:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:55:01,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825065213] [2024-11-16 23:55:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825065213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:01,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:55:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838216171] [2024-11-16 23:55:01,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:01,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:55:01,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:01,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:55:01,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:55:01,709 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.735632183908046) internal successors, (151), 104 states have internal predecessors, (151), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:55:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:01,728 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2024-11-16 23:55:01,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:55:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-16 23:55:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:01,735 INFO L225 Difference]: With dead ends: 104 [2024-11-16 23:55:01,736 INFO L226 Difference]: Without dead ends: 101 [2024-11-16 23:55:01,737 INFO L431 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 [2024-11-16 23:55:01,742 INFO L432 NwaCegarLoop]: 129 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, 129 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 [2024-11-16 23:55:01,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:55:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-16 23:55:01,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-16 23:55:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 98 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) [2024-11-16 23:55:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2024-11-16 23:55:01,814 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 6 [2024-11-16 23:55:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2024-11-16 23:55:01,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:55:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2024-11-16 23:55:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-16 23:55:01,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:01,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:55:01,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:55:01,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2034432553, now seen corresponding path program 1 times [2024-11-16 23:55:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294757349] [2024-11-16 23:55:01,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:55:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294757349] [2024-11-16 23:55:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294757349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:55:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652409220] [2024-11-16 23:55:01,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:01,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:55:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:01,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:55:01,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:55:01,906 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:55:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:01,969 INFO L93 Difference]: Finished difference Result 174 states and 218 transitions. [2024-11-16 23:55:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:55:01,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-16 23:55:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:01,972 INFO L225 Difference]: With dead ends: 174 [2024-11-16 23:55:01,973 INFO L226 Difference]: Without dead ends: 172 [2024-11-16 23:55:01,973 INFO L431 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 [2024-11-16 23:55:01,974 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 72 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 226 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.0s IncrementalHoareTripleChecker+Time [2024-11-16 23:55:01,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 226 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:55:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-16 23:55:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2024-11-16 23:55:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.313953488372093) internal successors, (113), 101 states have internal predecessors, (113), 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) [2024-11-16 23:55:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2024-11-16 23:55:01,985 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 7 [2024-11-16 23:55:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:01,985 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2024-11-16 23:55:01,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:55:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2024-11-16 23:55:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 23:55:01,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:01,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:55:01,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:55:01,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1100131738, now seen corresponding path program 1 times [2024-11-16 23:55:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:01,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636858879] [2024-11-16 23:55:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:01,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:55:02,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636858879] [2024-11-16 23:55:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636858879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:02,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:02,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:55:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064978068] [2024-11-16 23:55:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:02,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:55:02,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:02,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:55:02,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:55:02,068 INFO L87 Difference]: Start difference. First operand 104 states and 130 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) [2024-11-16 23:55:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:02,086 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2024-11-16 23:55:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:55:02,087 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 [2024-11-16 23:55:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:02,088 INFO L225 Difference]: With dead ends: 108 [2024-11-16 23:55:02,088 INFO L226 Difference]: Without dead ends: 107 [2024-11-16 23:55:02,088 INFO L431 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 [2024-11-16 23:55:02,089 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 242 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 [2024-11-16 23:55:02,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 242 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:55:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-16 23:55:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2024-11-16 23:55:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 100 states have internal predecessors, (111), 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) [2024-11-16 23:55:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2024-11-16 23:55:02,094 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 11 [2024-11-16 23:55:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:02,094 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2024-11-16 23:55:02,095 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) [2024-11-16 23:55:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2024-11-16 23:55:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 23:55:02,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:02,095 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:55:02,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:55:02,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:02,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:02,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1628366802, now seen corresponding path program 1 times [2024-11-16 23:55:02,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:02,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402515398] [2024-11-16 23:55:02,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:02,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:55:02,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:02,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402515398] [2024-11-16 23:55:02,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402515398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:02,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:02,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:55:02,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182001832] [2024-11-16 23:55:02,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:02,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:55:02,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:02,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:55:02,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:55:02,195 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-11-16 23:55:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:02,233 INFO L93 Difference]: Finished difference Result 130 states and 160 transitions. [2024-11-16 23:55:02,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:55:02,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-16 23:55:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:02,235 INFO L225 Difference]: With dead ends: 130 [2024-11-16 23:55:02,235 INFO L226 Difference]: Without dead ends: 130 [2024-11-16 23:55:02,235 INFO L431 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 [2024-11-16 23:55:02,236 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 69 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 315 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 [2024-11-16 23:55:02,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 315 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:55:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-16 23:55:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2024-11-16 23:55:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 100 states have internal predecessors, (110), 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) [2024-11-16 23:55:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2024-11-16 23:55:02,250 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 13 [2024-11-16 23:55:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2024-11-16 23:55:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-11-16 23:55:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2024-11-16 23:55:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 23:55:02,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:02,251 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:55:02,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:55:02,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2025307873, now seen corresponding path program 1 times [2024-11-16 23:55:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130712683] [2024-11-16 23:55:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:55:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130712683] [2024-11-16 23:55:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130712683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:55:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387892371] [2024-11-16 23:55:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:02,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:55:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:55:02,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:55:02,362 INFO L87 Difference]: Start difference. First operand 103 states and 127 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) [2024-11-16 23:55:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:02,452 INFO L93 Difference]: Finished difference Result 159 states and 195 transitions. [2024-11-16 23:55:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:55:02,452 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 [2024-11-16 23:55:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:02,453 INFO L225 Difference]: With dead ends: 159 [2024-11-16 23:55:02,453 INFO L226 Difference]: Without dead ends: 159 [2024-11-16 23:55:02,453 INFO L431 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 [2024-11-16 23:55:02,454 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 138 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 377 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 [2024-11-16 23:55:02,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 377 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:55:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-16 23:55:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2024-11-16 23:55:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 105 states have internal predecessors, (116), 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) [2024-11-16 23:55:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2024-11-16 23:55:02,460 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 17 [2024-11-16 23:55:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:02,461 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2024-11-16 23:55:02,461 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) [2024-11-16 23:55:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2024-11-16 23:55:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 23:55:02,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:02,462 INFO L215 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] [2024-11-16 23:55:02,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:55:02,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:02,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash -629340603, now seen corresponding path program 1 times [2024-11-16 23:55:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567360546] [2024-11-16 23:55:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:55:02,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:02,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567360546] [2024-11-16 23:55:02,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567360546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:02,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:02,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:55:02,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826916120] [2024-11-16 23:55:02,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:02,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:55:02,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:02,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:55:02,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:55:02,589 INFO L87 Difference]: Start difference. First operand 108 states and 132 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) [2024-11-16 23:55:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:02,727 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2024-11-16 23:55:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:55:02,727 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 [2024-11-16 23:55:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:02,728 INFO L225 Difference]: With dead ends: 107 [2024-11-16 23:55:02,728 INFO L226 Difference]: Without dead ends: 107 [2024-11-16 23:55:02,728 INFO L431 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 [2024-11-16 23:55:02,729 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 12 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 383 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 [2024-11-16 23:55:02,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 383 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:55:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-16 23:55:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-16 23:55:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 104 states have internal predecessors, (115), 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) [2024-11-16 23:55:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2024-11-16 23:55:02,734 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 25 [2024-11-16 23:55:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:02,734 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2024-11-16 23:55:02,735 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) [2024-11-16 23:55:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2024-11-16 23:55:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 23:55:02,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:02,735 INFO L215 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] [2024-11-16 23:55:02,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:55:02,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:02,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:02,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1875465031, now seen corresponding path program 1 times [2024-11-16 23:55:02,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:02,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581835047] [2024-11-16 23:55:02,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:55:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:02,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581835047] [2024-11-16 23:55:02,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581835047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:02,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:02,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:55:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044055192] [2024-11-16 23:55:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:02,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:55:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:55:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:55:02,842 INFO L87 Difference]: Start difference. First operand 107 states and 130 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) [2024-11-16 23:55:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:02,955 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2024-11-16 23:55:02,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:55:02,955 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 [2024-11-16 23:55:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:02,956 INFO L225 Difference]: With dead ends: 106 [2024-11-16 23:55:02,956 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 23:55:02,956 INFO L431 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 [2024-11-16 23:55:02,957 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 12 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 373 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 [2024-11-16 23:55:02,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 373 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:55:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 23:55:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-16 23:55:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 103 states have internal predecessors, (114), 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) [2024-11-16 23:55:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2024-11-16 23:55:02,961 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 25 [2024-11-16 23:55:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:02,961 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2024-11-16 23:55:02,961 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) [2024-11-16 23:55:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2024-11-16 23:55:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 23:55:02,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:02,962 INFO L215 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] [2024-11-16 23:55:02,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:55:02,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1042498625, now seen corresponding path program 1 times [2024-11-16 23:55:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378978445] [2024-11-16 23:55:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:55:03,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:03,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378978445] [2024-11-16 23:55:03,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378978445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:03,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:03,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 23:55:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161638058] [2024-11-16 23:55:03,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:03,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:55:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:03,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:55:03,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:55:03,070 INFO L87 Difference]: Start difference. First operand 106 states and 128 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) [2024-11-16 23:55:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:03,231 INFO L93 Difference]: Finished difference Result 156 states and 187 transitions. [2024-11-16 23:55:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 23:55:03,231 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 [2024-11-16 23:55:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:03,232 INFO L225 Difference]: With dead ends: 156 [2024-11-16 23:55:03,232 INFO L226 Difference]: Without dead ends: 156 [2024-11-16 23:55:03,232 INFO L431 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 [2024-11-16 23:55:03,233 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 118 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 402 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:55:03,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 402 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:55:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-16 23:55:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 112. [2024-11-16 23:55:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 109 states have internal predecessors, (120), 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) [2024-11-16 23:55:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2024-11-16 23:55:03,238 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 28 [2024-11-16 23:55:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:03,238 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2024-11-16 23:55:03,238 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) [2024-11-16 23:55:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2024-11-16 23:55:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 23:55:03,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:03,239 INFO L215 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] [2024-11-16 23:55:03,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:55:03,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:03,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1466977338, now seen corresponding path program 1 times [2024-11-16 23:55:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:03,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901490549] [2024-11-16 23:55:03,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:03,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:55:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:55:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:55:03,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901490549] [2024-11-16 23:55:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901490549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:55:03,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:55:03,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 23:55:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95073603] [2024-11-16 23:55:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:55:03,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:55:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:55:03,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:55:03,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:55:03,334 INFO L87 Difference]: Start difference. First operand 112 states and 134 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) [2024-11-16 23:55:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:55:03,533 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2024-11-16 23:55:03,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 23:55:03,533 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 [2024-11-16 23:55:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:55:03,534 INFO L225 Difference]: With dead ends: 155 [2024-11-16 23:55:03,534 INFO L226 Difference]: Without dead ends: 155 [2024-11-16 23:55:03,534 INFO L431 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 [2024-11-16 23:55:03,535 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 116 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 402 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 [2024-11-16 23:55:03,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 402 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 23:55:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-16 23:55:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 118. [2024-11-16 23:55:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 103 states have (on average 1.2233009708737863) internal successors, (126), 115 states have internal predecessors, (126), 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) [2024-11-16 23:55:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2024-11-16 23:55:03,545 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 28 [2024-11-16 23:55:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:55:03,545 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2024-11-16 23:55:03,545 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) [2024-11-16 23:55:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2024-11-16 23:55:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 23:55:03,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:55:03,549 INFO L215 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] [2024-11-16 23:55:03,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:55:03,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:55:03,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:55:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2014696162, now seen corresponding path program 1 times [2024-11-16 23:55:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:55:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800377941] [2024-11-16 23:55:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:55:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:55:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:55:03,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:55:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:55:03,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:55:03,628 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:55:03,629 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-16 23:55:03,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-16 23:55:03,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:55:03,634 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:55:03,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:55:03,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:55:03 BoogieIcfgContainer [2024-11-16 23:55:03,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:55:03,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:55:03,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:55:03,664 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:55:03,664 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:55:01" (3/4) ... [2024-11-16 23:55:03,665 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 23:55:03,703 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:55:03,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:55:03,705 INFO L158 Benchmark]: Toolchain (without parser) took 3206.41ms. Allocated memory was 211.8MB in the beginning and 289.4MB in the end (delta: 77.6MB). Free memory was 181.0MB in the beginning and 232.6MB in the end (delta: -51.6MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-16 23:55:03,705 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:55:03,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.43ms. Allocated memory is still 211.8MB. Free memory was 181.0MB in the beginning and 160.2MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 23:55:03,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.35ms. Allocated memory is still 211.8MB. Free memory was 160.2MB in the beginning and 157.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:55:03,706 INFO L158 Benchmark]: Boogie Preprocessor took 67.87ms. Allocated memory is still 211.8MB. Free memory was 157.0MB in the beginning and 152.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 23:55:03,706 INFO L158 Benchmark]: IcfgBuilder took 513.03ms. Allocated memory is still 211.8MB. Free memory was 152.8MB in the beginning and 121.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 23:55:03,707 INFO L158 Benchmark]: TraceAbstraction took 2173.56ms. Allocated memory was 211.8MB in the beginning and 289.4MB in the end (delta: 77.6MB). Free memory was 121.4MB in the beginning and 235.7MB in the end (delta: -114.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:55:03,707 INFO L158 Benchmark]: Witness Printer took 41.12ms. Allocated memory is still 289.4MB. Free memory was 235.7MB in the beginning and 232.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 23:55:03,708 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.16ms. Allocated memory is still 132.1MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.43ms. Allocated memory is still 211.8MB. Free memory was 181.0MB in the beginning and 160.2MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.35ms. Allocated memory is still 211.8MB. Free memory was 160.2MB in the beginning and 157.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.87ms. Allocated memory is still 211.8MB. Free memory was 157.0MB in the beginning and 152.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 513.03ms. Allocated memory is still 211.8MB. Free memory was 152.8MB in the beginning and 121.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2173.56ms. Allocated memory was 211.8MB in the beginning and 289.4MB in the end (delta: 77.6MB). Free memory was 121.4MB in the beginning and 235.7MB in the end (delta: -114.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 41.12ms. Allocated memory is still 289.4MB. Free memory was 235.7MB in the beginning and 232.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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() [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 FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND FALSE !(!(shape)) VAL [shape={-2:0}] [L615] COND FALSE !(0) VAL [shape={-2:0}] [L616] shape->next [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-2:0}] [L622] COND FALSE !(0) VAL [shape={-2:0}] [L623] EXPR shape->next [L623] COND FALSE !(!(shape->next == ((void *)0))) [L623] COND FALSE !(0) VAL [shape={-2:0}] [L624] EXPR shape->slist [L624] COND FALSE !(!(shape->slist)) [L624] COND FALSE !(0) VAL [shape={-2: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, 107 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 2849 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1832 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 602 IncrementalHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1017 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=118occurred 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, 231 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 652 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-16 23:55:03,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)