./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:51:10,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:51:10,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:51:10,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:51:10,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:51:10,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:51:10,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:51:10,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:51:10,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:51:10,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:51:10,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:51:10,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:51:10,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:51:10,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:51:10,740 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:51:10,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:51:10,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:51:10,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:51:10,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:51:10,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:51:10,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:51:10,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:51:10,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:51:10,741 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:51:10,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:51:10,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:51:10,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:51:10,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:51:10,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:51:10,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:51:10,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:51:10,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:51:10,745 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-01-09 21:51:11,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:51:11,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:51:11,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:51:11,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:51:11,038 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:51:11,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-01-09 21:51:12,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6ac24b65/e7ae59eaf3734c26972a02850801eb44/FLAGd6ba8b029 [2025-01-09 21:51:12,745 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:51:12,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-01-09 21:51:12,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6ac24b65/e7ae59eaf3734c26972a02850801eb44/FLAGd6ba8b029 [2025-01-09 21:51:12,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6ac24b65/e7ae59eaf3734c26972a02850801eb44 [2025-01-09 21:51:12,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:51:12,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:51:12,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:51:12,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:51:12,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:51:12,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:51:12" (1/1) ... [2025-01-09 21:51:12,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:12, skipping insertion in model container [2025-01-09 21:51:12,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:51:12" (1/1) ... [2025-01-09 21:51:12,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:51:13,338 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,379 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,382 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,389 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,401 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,437 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,438 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,439 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,440 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:51:13,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:51:13,457 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:51:13,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:51:13,603 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:51:13,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13 WrapperNode [2025-01-09 21:51:13,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:51:13,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:51:13,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:51:13,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:51:13,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,701 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1241 [2025-01-09 21:51:13,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:51:13,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:51:13,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:51:13,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:51:13,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,788 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-01-09 21:51:13,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:51:13,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:51:13,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:51:13,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:51:13,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (1/1) ... [2025-01-09 21:51:13,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:51:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:51:13,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:51:13,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:51:13,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:51:13,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:51:13,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 21:51:13,951 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:51:13,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:51:13,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 21:51:13,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:51:13,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:51:13,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:51:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 21:51:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:51:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:51:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:51:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 21:51:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:51:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:51:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 21:51:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:51:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:51:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:51:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:51:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 21:51:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:51:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:51:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 21:51:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:51:13,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:51:14,157 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:51:14,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:51:16,193 INFO L? ?]: Removed 296 outVars from TransFormulas that were not future-live. [2025-01-09 21:51:16,193 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:51:16,216 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:51:16,216 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 21:51:16,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:51:16 BoogieIcfgContainer [2025-01-09 21:51:16,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:51:16,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:51:16,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:51:16,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:51:16,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:51:12" (1/3) ... [2025-01-09 21:51:16,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742f2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:51:16, skipping insertion in model container [2025-01-09 21:51:16,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:51:13" (2/3) ... [2025-01-09 21:51:16,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742f2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:51:16, skipping insertion in model container [2025-01-09 21:51:16,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:51:16" (3/3) ... [2025-01-09 21:51:16,228 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2025-01-09 21:51:16,240 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:51:16,242 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test2-1.i that has 4 procedures, 375 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-01-09 21:51:16,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:51:16,292 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;@700b205d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:51:16,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:51:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 360 states have (on average 1.613888888888889) internal successors, (581), 362 states have internal predecessors, (581), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 21:51:16,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:16,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 21:51:16,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1665802, now seen corresponding path program 1 times [2025-01-09 21:51:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:16,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307068205] [2025-01-09 21:51:16,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:16,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:16,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 21:51:16,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 21:51:16,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:16,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:51:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307068205] [2025-01-09 21:51:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307068205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:51:16,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:51:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:51:16,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712748023] [2025-01-09 21:51:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:16,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:51:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:16,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:51:16,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:51:16,581 INFO L87 Difference]: Start difference. First operand has 367 states, 360 states have (on average 1.613888888888889) internal successors, (581), 362 states have internal predecessors, (581), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:16,844 INFO L93 Difference]: Finished difference Result 530 states and 771 transitions. [2025-01-09 21:51:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:51:16,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-01-09 21:51:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:16,863 INFO L225 Difference]: With dead ends: 530 [2025-01-09 21:51:16,864 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 21:51:16,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:51:16,870 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 239 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:16,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1544 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:51:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 21:51:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 522. [2025-01-09 21:51:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 516 states have (on average 1.4651162790697674) internal successors, (756), 517 states have internal predecessors, (756), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 762 transitions. [2025-01-09 21:51:16,947 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 762 transitions. Word has length 4 [2025-01-09 21:51:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:16,947 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 762 transitions. [2025-01-09 21:51:16,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 762 transitions. [2025-01-09 21:51:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 21:51:16,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:16,950 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:51:16,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:51:16,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1674606190, now seen corresponding path program 1 times [2025-01-09 21:51:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:16,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573634789] [2025-01-09 21:51:16,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:16,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:51:17,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:51:17,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:17,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:51:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573634789] [2025-01-09 21:51:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573634789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:51:17,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:51:17,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:51:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441062590] [2025-01-09 21:51:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:17,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:51:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:17,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:51:17,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:51:17,266 INFO L87 Difference]: Start difference. First operand 522 states and 762 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:17,370 INFO L93 Difference]: Finished difference Result 528 states and 754 transitions. [2025-01-09 21:51:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:51:17,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-01-09 21:51:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:17,373 INFO L225 Difference]: With dead ends: 528 [2025-01-09 21:51:17,373 INFO L226 Difference]: Without dead ends: 528 [2025-01-09 21:51:17,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:51:17,374 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 105 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:17,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1407 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:51:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-09 21:51:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 522. [2025-01-09 21:51:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 516 states have (on average 1.437984496124031) internal successors, (742), 517 states have internal predecessors, (742), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 748 transitions. [2025-01-09 21:51:17,398 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 748 transitions. Word has length 66 [2025-01-09 21:51:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:17,399 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 748 transitions. [2025-01-09 21:51:17,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 748 transitions. [2025-01-09 21:51:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 21:51:17,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:17,401 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:51:17,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:51:17,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash -560050974, now seen corresponding path program 1 times [2025-01-09 21:51:17,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54668241] [2025-01-09 21:51:17,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:17,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:17,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:51:17,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:51:17,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:17,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:51:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54668241] [2025-01-09 21:51:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54668241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:51:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:51:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:51:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236378656] [2025-01-09 21:51:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:51:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:18,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:51:18,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:51:18,059 INFO L87 Difference]: Start difference. First operand 522 states and 748 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:18,224 INFO L93 Difference]: Finished difference Result 721 states and 1033 transitions. [2025-01-09 21:51:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:51:18,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 66 [2025-01-09 21:51:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:18,228 INFO L225 Difference]: With dead ends: 721 [2025-01-09 21:51:18,232 INFO L226 Difference]: Without dead ends: 718 [2025-01-09 21:51:18,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:51:18,233 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 502 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:18,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2514 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:51:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-01-09 21:51:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 366. [2025-01-09 21:51:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 360 states have (on average 1.4333333333333333) internal successors, (516), 361 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 522 transitions. [2025-01-09 21:51:18,252 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 522 transitions. Word has length 66 [2025-01-09 21:51:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:18,253 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 522 transitions. [2025-01-09 21:51:18,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 522 transitions. [2025-01-09 21:51:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 21:51:18,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:18,259 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:51:18,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:51:18,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:18,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash 885018033, now seen corresponding path program 1 times [2025-01-09 21:51:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846766845] [2025-01-09 21:51:18,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:18,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:51:18,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:51:18,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:51:18,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:18,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846766845] [2025-01-09 21:51:18,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846766845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:51:18,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:51:18,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:51:18,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909216795] [2025-01-09 21:51:18,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:18,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:51:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:18,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:51:18,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:51:18,532 INFO L87 Difference]: Start difference. First operand 366 states and 522 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:18,620 INFO L93 Difference]: Finished difference Result 324 states and 445 transitions. [2025-01-09 21:51:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:51:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2025-01-09 21:51:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:18,623 INFO L225 Difference]: With dead ends: 324 [2025-01-09 21:51:18,623 INFO L226 Difference]: Without dead ends: 324 [2025-01-09 21:51:18,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:51:18,624 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 30 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:18,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1238 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:51:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-09 21:51:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-01-09 21:51:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 318 states have (on average 1.380503144654088) internal successors, (439), 319 states have internal predecessors, (439), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 445 transitions. [2025-01-09 21:51:18,636 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 445 transitions. Word has length 86 [2025-01-09 21:51:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:18,638 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 445 transitions. [2025-01-09 21:51:18,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2025-01-09 21:51:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 21:51:18,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:18,640 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:51:18,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:51:18,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:18,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash -369787995, now seen corresponding path program 1 times [2025-01-09 21:51:18,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:18,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915589790] [2025-01-09 21:51:18,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:18,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:51:18,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:51:18,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:18,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:51:18,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:18,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915589790] [2025-01-09 21:51:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915589790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:51:18,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:51:18,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:51:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019572846] [2025-01-09 21:51:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:18,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:51:18,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:18,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:51:18,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:51:18,855 INFO L87 Difference]: Start difference. First operand 324 states and 445 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:18,919 INFO L93 Difference]: Finished difference Result 551 states and 762 transitions. [2025-01-09 21:51:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:51:18,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2025-01-09 21:51:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:18,925 INFO L225 Difference]: With dead ends: 551 [2025-01-09 21:51:18,925 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 21:51:18,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:51:18,926 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 256 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:18,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1047 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:51:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 21:51:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 545. [2025-01-09 21:51:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 539 states have (on average 1.3951762523191094) internal successors, (752), 540 states have internal predecessors, (752), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 758 transitions. [2025-01-09 21:51:18,945 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 758 transitions. Word has length 86 [2025-01-09 21:51:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:18,946 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 758 transitions. [2025-01-09 21:51:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:51:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 758 transitions. [2025-01-09 21:51:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 21:51:18,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:18,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 21:51:18,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:51:18,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:18,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1564967685, now seen corresponding path program 1 times [2025-01-09 21:51:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543834186] [2025-01-09 21:51:18,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:18,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:19,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:51:19,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:51:19,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:19,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:51:19,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:19,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543834186] [2025-01-09 21:51:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543834186] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:51:19,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780505214] [2025-01-09 21:51:19,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:19,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:51:19,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:51:19,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:51:19,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:51:19,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:51:19,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:51:19,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:19,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:19,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 21:51:19,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:51:19,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:51:19,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 21:51:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:51:20,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:51:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780505214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:51:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:51:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 21:51:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799413758] [2025-01-09 21:51:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:51:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:20,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:51:20,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:51:20,997 INFO L87 Difference]: Start difference. First operand 545 states and 758 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:51:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:22,593 INFO L93 Difference]: Finished difference Result 786 states and 1088 transitions. [2025-01-09 21:51:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:51:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-01-09 21:51:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:22,597 INFO L225 Difference]: With dead ends: 786 [2025-01-09 21:51:22,597 INFO L226 Difference]: Without dead ends: 786 [2025-01-09 21:51:22,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 21:51:22,598 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 541 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:22,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 2579 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 21:51:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-01-09 21:51:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 545. [2025-01-09 21:51:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 539 states have (on average 1.3933209647495362) internal successors, (751), 540 states have internal predecessors, (751), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 757 transitions. [2025-01-09 21:51:22,621 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 757 transitions. Word has length 101 [2025-01-09 21:51:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:22,621 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 757 transitions. [2025-01-09 21:51:22,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:51:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 757 transitions. [2025-01-09 21:51:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 21:51:22,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:22,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:51:22,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:51:22,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:51:22,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:22,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1094970594, now seen corresponding path program 1 times [2025-01-09 21:51:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273694380] [2025-01-09 21:51:22,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:22,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:51:22,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:51:22,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:22,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:51:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273694380] [2025-01-09 21:51:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273694380] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:51:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786903036] [2025-01-09 21:51:23,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:23,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:51:23,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:51:23,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:51:23,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:51:23,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:51:23,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:51:23,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:23,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:23,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 21:51:23,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:51:23,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:51:23,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 21:51:23,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:51:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:51:23,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:51:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:51:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786903036] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 21:51:24,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:51:24,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 7] total 11 [2025-01-09 21:51:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665216553] [2025-01-09 21:51:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:24,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:51:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:24,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:51:24,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:51:24,023 INFO L87 Difference]: Start difference. First operand 545 states and 757 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:51:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:24,121 INFO L93 Difference]: Finished difference Result 709 states and 990 transitions. [2025-01-09 21:51:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:51:24,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-09 21:51:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:24,125 INFO L225 Difference]: With dead ends: 709 [2025-01-09 21:51:24,125 INFO L226 Difference]: Without dead ends: 709 [2025-01-09 21:51:24,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:51:24,126 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 563 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:24,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1263 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:51:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-01-09 21:51:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 547. [2025-01-09 21:51:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 541 states have (on average 1.3918669131238448) internal successors, (753), 542 states have internal predecessors, (753), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 759 transitions. [2025-01-09 21:51:24,140 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 759 transitions. Word has length 102 [2025-01-09 21:51:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:24,140 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 759 transitions. [2025-01-09 21:51:24,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:51:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 759 transitions. [2025-01-09 21:51:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 21:51:24,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:24,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2025-01-09 21:51:24,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:51:24,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:51:24,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:24,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1412929937, now seen corresponding path program 1 times [2025-01-09 21:51:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:24,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607047505] [2025-01-09 21:51:24,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:24,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 21:51:24,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 21:51:24,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:24,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:51:24,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:24,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607047505] [2025-01-09 21:51:24,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607047505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:51:24,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:51:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:51:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841706752] [2025-01-09 21:51:24,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:24,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:51:24,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:24,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:51:24,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:51:24,611 INFO L87 Difference]: Start difference. First operand 547 states and 759 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:51:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:25,800 INFO L93 Difference]: Finished difference Result 633 states and 868 transitions. [2025-01-09 21:51:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:51:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 158 [2025-01-09 21:51:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:25,803 INFO L225 Difference]: With dead ends: 633 [2025-01-09 21:51:25,804 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 21:51:25,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:51:25,804 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1006 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:25,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 21:51:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 21:51:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 413. [2025-01-09 21:51:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 407 states have (on average 1.366093366093366) internal successors, (556), 408 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 562 transitions. [2025-01-09 21:51:25,815 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 562 transitions. Word has length 158 [2025-01-09 21:51:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:25,815 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 562 transitions. [2025-01-09 21:51:25,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:51:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 562 transitions. [2025-01-09 21:51:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 21:51:25,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:25,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:51:25,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:51:25,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:25,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash -44444736, now seen corresponding path program 1 times [2025-01-09 21:51:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:25,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825779168] [2025-01-09 21:51:25,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:25,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:51:26,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:51:26,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:26,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:51:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:26,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825779168] [2025-01-09 21:51:26,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825779168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:51:26,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224679403] [2025-01-09 21:51:26,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:26,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:51:26,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:51:26,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:51:26,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:51:26,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:51:26,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:51:26,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:26,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:26,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 21:51:26,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:51:26,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:51:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:51:27,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:51:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224679403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:51:27,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:51:27,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-09 21:51:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388336672] [2025-01-09 21:51:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:51:27,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:51:27,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:51:27,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:51:27,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:51:27,370 INFO L87 Difference]: Start difference. First operand 413 states and 562 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:51:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:51:28,472 INFO L93 Difference]: Finished difference Result 670 states and 917 transitions. [2025-01-09 21:51:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:51:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-01-09 21:51:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:51:28,476 INFO L225 Difference]: With dead ends: 670 [2025-01-09 21:51:28,476 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 21:51:28,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 21:51:28,477 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 469 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 21:51:28,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2226 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 21:51:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 21:51:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 441. [2025-01-09 21:51:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 435 states have (on average 1.354022988505747) internal successors, (589), 436 states have internal predecessors, (589), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:51:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 595 transitions. [2025-01-09 21:51:28,489 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 595 transitions. Word has length 168 [2025-01-09 21:51:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:51:28,489 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 595 transitions. [2025-01-09 21:51:28,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:51:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 595 transitions. [2025-01-09 21:51:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 21:51:28,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:51:28,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:51:28,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:51:28,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:51:28,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:51:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:51:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2082260900, now seen corresponding path program 1 times [2025-01-09 21:51:28,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:51:28,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118430587] [2025-01-09 21:51:28,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:28,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:51:28,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:51:28,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:51:28,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:28,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:51:29,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:51:29,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118430587] [2025-01-09 21:51:29,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118430587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:51:29,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995227808] [2025-01-09 21:51:29,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:51:29,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:51:29,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:51:29,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:51:29,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:51:29,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:51:29,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:51:29,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:51:29,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:51:29,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:51:29,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:51:47,555 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 37 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 21:52:02,769 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 21:52:14,788 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 21:52:24,487 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 21:52:36,501 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)