./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-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 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:54:33,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:54:33,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-06 09:54:33,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:54:33,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:54:33,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:54:33,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:54:33,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:54:33,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:54:33,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:54:33,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:54:33,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:54:33,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:54:33,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:54:33,524 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:54:33,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:54:33,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:54:33,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:54:33,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:54:33,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:54:33,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:54:33,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:54:33,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:54:33,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:54:33,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:54:33,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:54:33,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:54:33,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:54:33,528 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 -> 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 [2025-02-06 09:54:33,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:54:33,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:54:33,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:54:33,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:54:33,757 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:54:33,757 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_OAT_test5-1.i [2025-02-06 09:54:34,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dee65b89b/fffad4f899e742fbbf8f0dfd79a21650/FLAGc3f981947 [2025-02-06 09:54:35,179 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:54:35,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2025-02-06 09:54:35,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dee65b89b/fffad4f899e742fbbf8f0dfd79a21650/FLAGc3f981947 [2025-02-06 09:54:35,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dee65b89b/fffad4f899e742fbbf8f0dfd79a21650 [2025-02-06 09:54:35,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:54:35,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:54:35,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:54:35,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:54:35,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:54:35,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:35,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134c02e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35, skipping insertion in model container [2025-02-06 09:54:35,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:35,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:54:35,734 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,755 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,758 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,761 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,766 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,790 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,791 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,793 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,798 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,818 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,819 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,820 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,820 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:54:35,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:54:35,835 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:54:35,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:54:35,954 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:54:35,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35 WrapperNode [2025-02-06 09:54:35,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:54:35,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:54:35,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:54:35,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:54:35,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:35,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,030 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1974 [2025-02-06 09:54:36,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:54:36,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:54:36,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:54:36,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:54:36,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,124 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2025-02-06 09:54:36,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:54:36,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:54:36,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:54:36,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:54:36,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (1/1) ... [2025-02-06 09:54:36,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:54:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:54:36,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:54:36,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 09:54:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 09:54:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 09:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 09:54:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 09:54:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 09:54:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 09:54:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:54:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:54:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 09:54:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 09:54:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 09:54:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:54:36,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:54:36,430 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:54:36,432 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:54:37,723 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-02-06 09:54:37,833 INFO L? ?]: Removed 484 outVars from TransFormulas that were not future-live. [2025-02-06 09:54:37,833 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:54:37,890 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:54:37,894 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 09:54:37,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:54:37 BoogieIcfgContainer [2025-02-06 09:54:37,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:54:37,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:54:37,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:54:37,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:54:37,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:54:35" (1/3) ... [2025-02-06 09:54:37,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4557bfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:54:37, skipping insertion in model container [2025-02-06 09:54:37,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:54:35" (2/3) ... [2025-02-06 09:54:37,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4557bfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:54:37, skipping insertion in model container [2025-02-06 09:54:37,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:54:37" (3/3) ... [2025-02-06 09:54:37,903 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-1.i [2025-02-06 09:54:37,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:54:37,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test5-1.i that has 6 procedures, 574 locations, 1 initial locations, 49 loop locations, and 2 error locations. [2025-02-06 09:54:37,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:54:37,965 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;@3df2e1a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:54:37,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 09:54:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 566 states, 547 states have (on average 1.6179159049360146) internal successors, (885), 556 states have internal predecessors, (885), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:54:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 09:54:37,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:37,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 09:54:37,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:37,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash 964108543, now seen corresponding path program 1 times [2025-02-06 09:54:37,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:37,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586341850] [2025-02-06 09:54:37,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:38,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 09:54:38,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 09:54:38,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:38,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:54:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586341850] [2025-02-06 09:54:38,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586341850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:54:38,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:54:38,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:54:38,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108724657] [2025-02-06 09:54:38,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:54:38,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:54:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:38,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:54:38,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:54:38,169 INFO L87 Difference]: Start difference. First operand has 566 states, 547 states have (on average 1.6179159049360146) internal successors, (885), 556 states have internal predecessors, (885), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:54:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:38,419 INFO L93 Difference]: Finished difference Result 1110 states and 1630 transitions. [2025-02-06 09:54:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:54:38,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 09:54:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:38,431 INFO L225 Difference]: With dead ends: 1110 [2025-02-06 09:54:38,431 INFO L226 Difference]: Without dead ends: 1108 [2025-02-06 09:54:38,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:54:38,436 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 781 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:38,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1593 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:54:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-02-06 09:54:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 564. [2025-02-06 09:54:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 547 states have (on average 1.4625228519195612) internal successors, (800), 554 states have internal predecessors, (800), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 09:54:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 824 transitions. [2025-02-06 09:54:38,492 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 824 transitions. Word has length 5 [2025-02-06 09:54:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:38,492 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 824 transitions. [2025-02-06 09:54:38,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:54:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 824 transitions. [2025-02-06 09:54:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 09:54:38,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:38,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:38,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:54:38,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:38,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1278175710, now seen corresponding path program 1 times [2025-02-06 09:54:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:38,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475279625] [2025-02-06 09:54:38,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:38,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:38,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 09:54:38,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 09:54:38,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:38,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:54:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475279625] [2025-02-06 09:54:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475279625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:54:39,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:54:39,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:54:39,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436072241] [2025-02-06 09:54:39,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:54:39,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:54:39,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:39,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:54:39,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:54:39,154 INFO L87 Difference]: Start difference. First operand 564 states and 824 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:54:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:39,352 INFO L93 Difference]: Finished difference Result 567 states and 820 transitions. [2025-02-06 09:54:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:54:39,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-06 09:54:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:39,356 INFO L225 Difference]: With dead ends: 567 [2025-02-06 09:54:39,356 INFO L226 Difference]: Without dead ends: 567 [2025-02-06 09:54:39,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:54:39,357 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 105 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:39,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2112 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:54:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-06 09:54:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 564. [2025-02-06 09:54:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 547 states have (on average 1.4497257769652652) internal successors, (793), 554 states have internal predecessors, (793), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 09:54:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 817 transitions. [2025-02-06 09:54:39,384 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 817 transitions. Word has length 206 [2025-02-06 09:54:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:39,384 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 817 transitions. [2025-02-06 09:54:39,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:54:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 817 transitions. [2025-02-06 09:54:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 09:54:39,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:39,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:39,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:54:39,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:39,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2146269093, now seen corresponding path program 1 times [2025-02-06 09:54:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:39,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251890352] [2025-02-06 09:54:39,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:39,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 09:54:39,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 09:54:39,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:39,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:54:39,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251890352] [2025-02-06 09:54:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251890352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:54:39,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:54:39,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:54:39,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264282867] [2025-02-06 09:54:39,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:54:39,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:54:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:39,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:54:39,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:54:39,695 INFO L87 Difference]: Start difference. First operand 564 states and 817 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:54:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:39,837 INFO L93 Difference]: Finished difference Result 692 states and 1004 transitions. [2025-02-06 09:54:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:54:39,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-06 09:54:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:39,840 INFO L225 Difference]: With dead ends: 692 [2025-02-06 09:54:39,840 INFO L226 Difference]: Without dead ends: 692 [2025-02-06 09:54:39,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:54:39,841 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 134 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:39,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1495 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:54:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-02-06 09:54:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2025-02-06 09:54:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 675 states have (on average 1.451851851851852) internal successors, (980), 682 states have internal predecessors, (980), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 09:54:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1004 transitions. [2025-02-06 09:54:39,855 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1004 transitions. Word has length 206 [2025-02-06 09:54:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1004 transitions. [2025-02-06 09:54:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:54:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1004 transitions. [2025-02-06 09:54:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 09:54:39,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:39,858 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:39,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:54:39,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:39,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1485045444, now seen corresponding path program 1 times [2025-02-06 09:54:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:39,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494759116] [2025-02-06 09:54:39,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:39,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:54:39,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:54:39,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:39,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:54:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494759116] [2025-02-06 09:54:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494759116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:54:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:54:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:54:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840790331] [2025-02-06 09:54:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:54:40,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:54:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:40,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:54:40,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:54:40,219 INFO L87 Difference]: Start difference. First operand 692 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:54:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:40,382 INFO L93 Difference]: Finished difference Result 695 states and 1000 transitions. [2025-02-06 09:54:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:54:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 221 [2025-02-06 09:54:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:40,386 INFO L225 Difference]: With dead ends: 695 [2025-02-06 09:54:40,387 INFO L226 Difference]: Without dead ends: 695 [2025-02-06 09:54:40,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:54:40,390 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 105 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:40,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2091 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:54:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-02-06 09:54:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 692. [2025-02-06 09:54:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 675 states have (on average 1.4414814814814816) internal successors, (973), 682 states have internal predecessors, (973), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 09:54:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 997 transitions. [2025-02-06 09:54:40,406 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 997 transitions. Word has length 221 [2025-02-06 09:54:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:40,406 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 997 transitions. [2025-02-06 09:54:40,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:54:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 997 transitions. [2025-02-06 09:54:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 09:54:40,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:40,409 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:40,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:54:40,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:40,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:40,410 INFO L85 PathProgramCache]: Analyzing trace with hash 229206083, now seen corresponding path program 1 times [2025-02-06 09:54:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:40,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315871301] [2025-02-06 09:54:40,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:40,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:40,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:54:40,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:54:40,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:40,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:54:40,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:40,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315871301] [2025-02-06 09:54:40,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315871301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:54:40,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:54:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:54:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867697137] [2025-02-06 09:54:40,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:54:40,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:54:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:40,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:54:40,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:54:40,664 INFO L87 Difference]: Start difference. First operand 692 states and 997 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:54:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:40,779 INFO L93 Difference]: Finished difference Result 698 states and 1003 transitions. [2025-02-06 09:54:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:54:40,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 221 [2025-02-06 09:54:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:40,782 INFO L225 Difference]: With dead ends: 698 [2025-02-06 09:54:40,782 INFO L226 Difference]: Without dead ends: 698 [2025-02-06 09:54:40,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:54:40,783 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:40,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1456 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:54:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-02-06 09:54:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-02-06 09:54:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 681 states have (on average 1.4375917767988253) internal successors, (979), 688 states have internal predecessors, (979), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 09:54:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1003 transitions. [2025-02-06 09:54:40,799 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1003 transitions. Word has length 221 [2025-02-06 09:54:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:40,800 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1003 transitions. [2025-02-06 09:54:40,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:54:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1003 transitions. [2025-02-06 09:54:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 09:54:40,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:40,803 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:40,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:54:40,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:40,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash 748498370, now seen corresponding path program 1 times [2025-02-06 09:54:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:40,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136206140] [2025-02-06 09:54:40,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:40,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:40,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:54:40,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:54:40,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:40,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:54:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136206140] [2025-02-06 09:54:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136206140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:54:41,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:54:41,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:54:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58901882] [2025-02-06 09:54:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:54:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:54:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:41,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:54:41,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:54:41,073 INFO L87 Difference]: Start difference. First operand 698 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:54:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:41,257 INFO L93 Difference]: Finished difference Result 1037 states and 1498 transitions. [2025-02-06 09:54:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:54:41,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 221 [2025-02-06 09:54:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:41,262 INFO L225 Difference]: With dead ends: 1037 [2025-02-06 09:54:41,262 INFO L226 Difference]: Without dead ends: 1037 [2025-02-06 09:54:41,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:54:41,262 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 530 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:41,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1651 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:54:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-02-06 09:54:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1034. [2025-02-06 09:54:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1009 states have (on average 1.4430128840436076) internal successors, (1456), 1021 states have internal predecessors, (1456), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 09:54:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1496 transitions. [2025-02-06 09:54:41,281 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1496 transitions. Word has length 221 [2025-02-06 09:54:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:41,281 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1496 transitions. [2025-02-06 09:54:41,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:54:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1496 transitions. [2025-02-06 09:54:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-06 09:54:41,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:41,283 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:41,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:54:41,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash -119762489, now seen corresponding path program 1 times [2025-02-06 09:54:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:41,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704348150] [2025-02-06 09:54:41,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:41,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:54:41,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:54:41,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:41,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:54:41,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704348150] [2025-02-06 09:54:41,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704348150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:54:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168831840] [2025-02-06 09:54:41,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:41,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:54:41,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:54:41,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:54:41,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:54:41,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:54:41,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:54:41,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:41,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:41,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:54:41,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:54:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 09:54:41,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:54:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168831840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:54:41,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:54:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 09:54:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384142290] [2025-02-06 09:54:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:54:41,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:54:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:41,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:54:41,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:54:41,991 INFO L87 Difference]: Start difference. First operand 1034 states and 1496 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:54:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:42,123 INFO L93 Difference]: Finished difference Result 1074 states and 1536 transitions. [2025-02-06 09:54:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:54:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 236 [2025-02-06 09:54:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:42,128 INFO L225 Difference]: With dead ends: 1074 [2025-02-06 09:54:42,128 INFO L226 Difference]: Without dead ends: 1074 [2025-02-06 09:54:42,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:54:42,129 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 8 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:42,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1435 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:54:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-02-06 09:54:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2025-02-06 09:54:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1049 states have (on average 1.4261201143946616) internal successors, (1496), 1061 states have internal predecessors, (1496), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 09:54:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1536 transitions. [2025-02-06 09:54:42,147 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1536 transitions. Word has length 236 [2025-02-06 09:54:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:42,148 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1536 transitions. [2025-02-06 09:54:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:54:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1536 transitions. [2025-02-06 09:54:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-06 09:54:42,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:42,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:42,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:54:42,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:54:42,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:42,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash -243835736, now seen corresponding path program 1 times [2025-02-06 09:54:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982598829] [2025-02-06 09:54:42,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:42,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:54:42,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:54:42,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:42,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:54:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982598829] [2025-02-06 09:54:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982598829] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:54:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601042219] [2025-02-06 09:54:42,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:42,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:54:42,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:54:42,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:54:42,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:54:42,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:54:43,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:54:43,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:43,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:43,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:54:43,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:54:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 09:54:43,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:54:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601042219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:54:43,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:54:43,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 09:54:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387477729] [2025-02-06 09:54:43,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:54:43,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:54:43,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:43,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:54:43,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:54:43,057 INFO L87 Difference]: Start difference. First operand 1074 states and 1536 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:54:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:43,207 INFO L93 Difference]: Finished difference Result 1046 states and 1494 transitions. [2025-02-06 09:54:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:54:43,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 236 [2025-02-06 09:54:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:43,211 INFO L225 Difference]: With dead ends: 1046 [2025-02-06 09:54:43,211 INFO L226 Difference]: Without dead ends: 1046 [2025-02-06 09:54:43,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:54:43,212 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 105 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:43,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2070 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:54:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-02-06 09:54:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-02-06 09:54:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1021 states have (on average 1.4240940254652301) internal successors, (1454), 1033 states have internal predecessors, (1454), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 09:54:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1494 transitions. [2025-02-06 09:54:43,229 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1494 transitions. Word has length 236 [2025-02-06 09:54:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:43,230 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1494 transitions. [2025-02-06 09:54:43,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:54:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1494 transitions. [2025-02-06 09:54:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-06 09:54:43,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:43,232 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:43,240 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-02-06 09:54:43,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:54:43,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:43,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash -391583295, now seen corresponding path program 1 times [2025-02-06 09:54:43,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:43,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494866593] [2025-02-06 09:54:43,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:43,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:54:43,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:54:43,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:43,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:54:43,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494866593] [2025-02-06 09:54:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494866593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:54:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145681719] [2025-02-06 09:54:43,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:43,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:54:43,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:54:43,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:54:43,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:54:43,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:54:44,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:54:44,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:44,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:44,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:54:44,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:54:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:54:44,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:54:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:54:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145681719] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:54:44,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:54:44,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 09:54:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222243787] [2025-02-06 09:54:44,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:54:44,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:54:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:44,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:54:44,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:54:44,418 INFO L87 Difference]: Start difference. First operand 1046 states and 1494 transitions. Second operand has 7 states, 7 states have (on average 75.57142857142857) internal successors, (529), 7 states have internal predecessors, (529), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 09:54:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:44,808 INFO L93 Difference]: Finished difference Result 2390 states and 3417 transitions. [2025-02-06 09:54:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:54:44,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.57142857142857) internal successors, (529), 7 states have internal predecessors, (529), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 236 [2025-02-06 09:54:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:44,816 INFO L225 Difference]: With dead ends: 2390 [2025-02-06 09:54:44,816 INFO L226 Difference]: Without dead ends: 2390 [2025-02-06 09:54:44,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:54:44,817 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 3947 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3978 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:44,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3978 Valid, 3067 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 09:54:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2025-02-06 09:54:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2069. [2025-02-06 09:54:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2019 states have (on average 1.41505695889054) internal successors, (2857), 2041 states have internal predecessors, (2857), 46 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (44), 28 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 09:54:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2947 transitions. [2025-02-06 09:54:44,854 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2947 transitions. Word has length 236 [2025-02-06 09:54:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:44,854 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 2947 transitions. [2025-02-06 09:54:44,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.57142857142857) internal successors, (529), 7 states have internal predecessors, (529), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 09:54:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2947 transitions. [2025-02-06 09:54:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-02-06 09:54:44,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:44,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:44,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:54:45,069 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-02-06 09:54:45,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1529896053, now seen corresponding path program 1 times [2025-02-06 09:54:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390962545] [2025-02-06 09:54:45,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:45,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-02-06 09:54:45,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-02-06 09:54:45,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:45,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 4 proven. 363 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-02-06 09:54:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:54:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390962545] [2025-02-06 09:54:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390962545] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:54:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203932531] [2025-02-06 09:54:45,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:54:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:54:45,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:54:45,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:54:46,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-02-06 09:54:46,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-02-06 09:54:46,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:54:46,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:54:46,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 3260 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:54:46,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:54:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:54:47,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:54:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:54:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203932531] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:54:47,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:54:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-02-06 09:54:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236823679] [2025-02-06 09:54:47,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:54:47,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:54:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:54:47,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:54:47,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:54:47,733 INFO L87 Difference]: Start difference. First operand 2069 states and 2947 transitions. Second operand has 14 states, 14 states have (on average 112.28571428571429) internal successors, (1572), 14 states have internal predecessors, (1572), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 09:54:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:54:52,601 INFO L93 Difference]: Finished difference Result 4824 states and 6863 transitions. [2025-02-06 09:54:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:54:52,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 112.28571428571429) internal successors, (1572), 14 states have internal predecessors, (1572), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 668 [2025-02-06 09:54:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:54:52,618 INFO L225 Difference]: With dead ends: 4824 [2025-02-06 09:54:52,618 INFO L226 Difference]: Without dead ends: 4824 [2025-02-06 09:54:52,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1350 GetRequests, 1326 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-02-06 09:54:52,619 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 16719 mSDsluCounter, 6568 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16719 SdHoareTripleChecker+Valid, 7910 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 09:54:52,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16719 Valid, 7910 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 09:54:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2025-02-06 09:54:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4649. [2025-02-06 09:54:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4649 states, 4576 states have (on average 1.4147727272727273) internal successors, (6474), 4603 states have internal predecessors, (6474), 69 states have call successors, (69), 3 states have call predecessors, (69), 2 states have return successors, (67), 47 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 09:54:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 6610 transitions. [2025-02-06 09:54:52,686 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 6610 transitions. Word has length 668 [2025-02-06 09:54:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:54:52,686 INFO L471 AbstractCegarLoop]: Abstraction has 4649 states and 6610 transitions. [2025-02-06 09:54:52,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 112.28571428571429) internal successors, (1572), 14 states have internal predecessors, (1572), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 09:54:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 6610 transitions. [2025-02-06 09:54:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2025-02-06 09:54:52,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:54:52,703 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:54:52,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 09:54:52,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 09:54:52,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:54:52,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:54:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash 537081999, now seen corresponding path program 1 times [2025-02-06 09:54:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:54:52,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251953890] [2025-02-06 09:54:52,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:54:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:54:53,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1542 statements into 1 equivalence classes.